./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-86.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-25_file-86.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 c41233577d4f3add43688eebc1dd327b554f3a213d6a52593493024e00cc2d82 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:00:11,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:00:11,223 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:00:11,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:00:11,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:00:11,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:00:11,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:00:11,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:00:11,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:00:11,261 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:00:11,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:00:11,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:00:11,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:00:11,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:00:11,263 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:00:11,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:00:11,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:00:11,264 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:00:11,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:00:11,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:00:11,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:00:11,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:00:11,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:00:11,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:00:11,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:00:11,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:00:11,264 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:00:11,265 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:00:11,265 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:00:11,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:00:11,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:00:11,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:00:11,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:00:11,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:00:11,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:00:11,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:00:11,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:00:11,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:00:11,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:00:11,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:00:11,266 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:00:11,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:00:11,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:00:11,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:00:11,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:00:11,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:00:11,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:00:11,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:00:11,267 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 -> c41233577d4f3add43688eebc1dd327b554f3a213d6a52593493024e00cc2d82 [2025-01-09 10:00:11,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:00:11,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:00:11,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:00:11,553 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:00:11,553 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:00:11,553 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-25_file-86.i [2025-01-09 10:00:12,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/046558f3b/0f546c68af594d2d9e0584337e3ad682/FLAGeeb0d5171 [2025-01-09 10:00:13,084 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:00:13,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-86.i [2025-01-09 10:00:13,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/046558f3b/0f546c68af594d2d9e0584337e3ad682/FLAGeeb0d5171 [2025-01-09 10:00:13,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/046558f3b/0f546c68af594d2d9e0584337e3ad682 [2025-01-09 10:00:13,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:00:13,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:00:13,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:00:13,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:00:13,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:00:13,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:00:13" (1/1) ... [2025-01-09 10:00:13,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d7b6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:13, skipping insertion in model container [2025-01-09 10:00:13,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:00:13" (1/1) ... [2025-01-09 10:00:13,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:00:13,532 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-25_file-86.i[915,928] [2025-01-09 10:00:13,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:00:13,626 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:00:13,637 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-25_file-86.i[915,928] [2025-01-09 10:00:13,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:00:13,705 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:00:13,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:13 WrapperNode [2025-01-09 10:00:13,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:00:13,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:00:13,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:00:13,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:00:13,714 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:00:13" (1/1) ... [2025-01-09 10:00:13,728 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:00:13" (1/1) ... [2025-01-09 10:00:13,769 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2025-01-09 10:00:13,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:00:13,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:00:13,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:00:13,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:00:13,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:13" (1/1) ... [2025-01-09 10:00:13,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:13" (1/1) ... [2025-01-09 10:00:13,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:13" (1/1) ... [2025-01-09 10:00:13,814 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:00:13,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:13" (1/1) ... [2025-01-09 10:00:13,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:13" (1/1) ... [2025-01-09 10:00:13,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:13" (1/1) ... [2025-01-09 10:00:13,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:13" (1/1) ... [2025-01-09 10:00:13,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:13" (1/1) ... [2025-01-09 10:00:13,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:13" (1/1) ... [2025-01-09 10:00:13,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:13" (1/1) ... [2025-01-09 10:00:13,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:00:13,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:00:13,841 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:00:13,841 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:00:13,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:13" (1/1) ... [2025-01-09 10:00:13,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:00:13,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:00:13,871 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:00:13,875 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:00:13,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:00:13,896 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:00:13,896 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:00:13,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:00:13,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:00:13,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:00:13,981 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:00:13,982 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:00:14,368 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 10:00:14,368 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:00:14,382 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:00:14,383 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:00:14,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:00:14 BoogieIcfgContainer [2025-01-09 10:00:14,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:00:14,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:00:14,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:00:14,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:00:14,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:00:13" (1/3) ... [2025-01-09 10:00:14,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b29d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:00:14, skipping insertion in model container [2025-01-09 10:00:14,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:00:13" (2/3) ... [2025-01-09 10:00:14,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b29d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:00:14, skipping insertion in model container [2025-01-09 10:00:14,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:00:14" (3/3) ... [2025-01-09 10:00:14,392 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-86.i [2025-01-09 10:00:14,404 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:00:14,405 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-86.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:00:14,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:00:14,469 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;@11d1a02e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:00:14,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:00:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 10:00:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 10:00:14,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:14,493 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:14,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:14,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:14,499 INFO L85 PathProgramCache]: Analyzing trace with hash 877075667, now seen corresponding path program 1 times [2025-01-09 10:00:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:14,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764809412] [2025-01-09 10:00:14,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:14,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 10:00:14,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 10:00:14,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:14,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-01-09 10:00:14,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:00:14,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764809412] [2025-01-09 10:00:14,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764809412] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:00:14,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985122237] [2025-01-09 10:00:14,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:14,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:00:14,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:00:14,901 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:00:14,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:00:15,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 10:00:15,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 10:00:15,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:15,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:15,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:00:15,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:00:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-01-09 10:00:15,188 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:00:15,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985122237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:15,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:00:15,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:00:15,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423241396] [2025-01-09 10:00:15,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:15,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:00:15,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:00:15,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:00:15,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:00:15,214 INFO L87 Difference]: Start difference. First operand has 100 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 10:00:15,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:15,248 INFO L93 Difference]: Finished difference Result 194 states and 343 transitions. [2025-01-09 10:00:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:00:15,249 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 212 [2025-01-09 10:00:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:15,256 INFO L225 Difference]: With dead ends: 194 [2025-01-09 10:00:15,257 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 10:00:15,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 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:00:15,263 INFO L435 NwaCegarLoop]: 150 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, 150 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:00:15,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:00:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 10:00:15,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 10:00:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 10:00:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 150 transitions. [2025-01-09 10:00:15,303 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 150 transitions. Word has length 212 [2025-01-09 10:00:15,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:15,304 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 150 transitions. [2025-01-09 10:00:15,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 10:00:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 150 transitions. [2025-01-09 10:00:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 10:00:15,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:15,308 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:15,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:00:15,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:00:15,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:15,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash 987523919, now seen corresponding path program 1 times [2025-01-09 10:00:15,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:15,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71852444] [2025-01-09 10:00:15,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:15,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 10:00:15,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 10:00:15,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:15,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:00:15,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:00:15,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71852444] [2025-01-09 10:00:15,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71852444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:15,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:15,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:00:15,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541542468] [2025-01-09 10:00:15,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:15,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:00:15,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:00:15,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:00:15,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:00:15,943 INFO L87 Difference]: Start difference. First operand 97 states and 150 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:16,179 INFO L93 Difference]: Finished difference Result 192 states and 299 transitions. [2025-01-09 10:00:16,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:00:16,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 212 [2025-01-09 10:00:16,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:16,186 INFO L225 Difference]: With dead ends: 192 [2025-01-09 10:00:16,186 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 10:00:16,188 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 10:00:16,190 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 147 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:00:16,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 185 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:00:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 10:00:16,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 10:00:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 10:00:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 151 transitions. [2025-01-09 10:00:16,209 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 151 transitions. Word has length 212 [2025-01-09 10:00:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:16,210 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 151 transitions. [2025-01-09 10:00:16,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2025-01-09 10:00:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 10:00:16,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:16,215 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:16,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:00:16,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:16,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1273452288, now seen corresponding path program 1 times [2025-01-09 10:00:16,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:16,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517677003] [2025-01-09 10:00:16,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:16,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:16,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 10:00:16,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 10:00:16,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:16,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:16,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:00:16,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:00:16,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517677003] [2025-01-09 10:00:16,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517677003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:16,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:16,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:00:16,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179485459] [2025-01-09 10:00:16,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:16,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:00:16,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:00:16,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:00:16,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:00:16,526 INFO L87 Difference]: Start difference. First operand 98 states and 151 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:16,862 INFO L93 Difference]: Finished difference Result 278 states and 426 transitions. [2025-01-09 10:00:16,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:00:16,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-01-09 10:00:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:16,867 INFO L225 Difference]: With dead ends: 278 [2025-01-09 10:00:16,867 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 10:00:16,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:00:16,871 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 201 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:00:16,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 662 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:00:16,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 10:00:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 127. [2025-01-09 10:00:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 10:00:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 194 transitions. [2025-01-09 10:00:16,904 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 194 transitions. Word has length 214 [2025-01-09 10:00:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:16,905 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 194 transitions. [2025-01-09 10:00:16,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2025-01-09 10:00:16,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 10:00:16,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:16,909 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:16,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:00:16,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:16,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:16,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2000446654, now seen corresponding path program 1 times [2025-01-09 10:00:16,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:16,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040040553] [2025-01-09 10:00:16,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:16,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:16,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 10:00:16,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 10:00:16,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:16,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:00:17,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:00:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040040553] [2025-01-09 10:00:17,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040040553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:17,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:17,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:00:17,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027784805] [2025-01-09 10:00:17,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:17,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:00:17,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:00:17,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:00:17,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:00:17,203 INFO L87 Difference]: Start difference. First operand 127 states and 194 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:17,480 INFO L93 Difference]: Finished difference Result 303 states and 460 transitions. [2025-01-09 10:00:17,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:00:17,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-01-09 10:00:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:17,483 INFO L225 Difference]: With dead ends: 303 [2025-01-09 10:00:17,483 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 10:00:17,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:00:17,484 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 123 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:00:17,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 501 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:00:17,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 10:00:17,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2025-01-09 10:00:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 110 states have (on average 1.2818181818181817) internal successors, (141), 110 states have internal predecessors, (141), 68 states have call successors, (68), 3 states have call predecessors, (68), 3 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 10:00:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 277 transitions. [2025-01-09 10:00:17,523 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 277 transitions. Word has length 214 [2025-01-09 10:00:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:17,525 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 277 transitions. [2025-01-09 10:00:17,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 277 transitions. [2025-01-09 10:00:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 10:00:17,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:17,527 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:17,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:00:17,527 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:17,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:17,528 INFO L85 PathProgramCache]: Analyzing trace with hash 989329404, now seen corresponding path program 1 times [2025-01-09 10:00:17,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:17,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605778446] [2025-01-09 10:00:17,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:17,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:17,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 10:00:17,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 10:00:17,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:17,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:25,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:00:25,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:00:25,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605778446] [2025-01-09 10:00:25,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605778446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:25,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:25,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 10:00:25,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123230184] [2025-01-09 10:00:25,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:25,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 10:00:25,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:00:25,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 10:00:25,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:00:25,567 INFO L87 Difference]: Start difference. First operand 182 states and 277 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:29,138 INFO L93 Difference]: Finished difference Result 359 states and 536 transitions. [2025-01-09 10:00:29,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:00:29,139 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-01-09 10:00:29,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:29,142 INFO L225 Difference]: With dead ends: 359 [2025-01-09 10:00:29,142 INFO L226 Difference]: Without dead ends: 258 [2025-01-09 10:00:29,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2025-01-09 10:00:29,144 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 363 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:00:29,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1039 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 10:00:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-09 10:00:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 199. [2025-01-09 10:00:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 68 states have call successors, (68), 3 states have call predecessors, (68), 3 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 10:00:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 300 transitions. [2025-01-09 10:00:29,180 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 300 transitions. Word has length 214 [2025-01-09 10:00:29,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:29,181 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 300 transitions. [2025-01-09 10:00:29,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:29,182 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 300 transitions. [2025-01-09 10:00:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 10:00:29,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:29,188 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:29,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:00:29,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:29,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:29,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1690393982, now seen corresponding path program 1 times [2025-01-09 10:00:29,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:29,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775234564] [2025-01-09 10:00:29,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:29,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:29,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 10:00:29,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 10:00:29,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:29,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:29,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:00:29,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:00:29,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775234564] [2025-01-09 10:00:29,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775234564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:29,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:29,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:00:29,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399234647] [2025-01-09 10:00:29,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:29,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:00:29,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:00:29,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:00:29,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:00:29,279 INFO L87 Difference]: Start difference. First operand 199 states and 300 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:29,328 INFO L93 Difference]: Finished difference Result 400 states and 604 transitions. [2025-01-09 10:00:29,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:00:29,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-01-09 10:00:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:29,331 INFO L225 Difference]: With dead ends: 400 [2025-01-09 10:00:29,332 INFO L226 Difference]: Without dead ends: 299 [2025-01-09 10:00:29,332 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:00:29,336 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 142 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:00:29,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 300 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:00:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-01-09 10:00:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2025-01-09 10:00:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 189 states have (on average 1.2857142857142858) internal successors, (243), 189 states have internal predecessors, (243), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 10:00:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 447 transitions. [2025-01-09 10:00:29,375 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 447 transitions. Word has length 214 [2025-01-09 10:00:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:29,376 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 447 transitions. [2025-01-09 10:00:29,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 447 transitions. [2025-01-09 10:00:29,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 10:00:29,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:29,380 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:29,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:00:29,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:29,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:29,381 INFO L85 PathProgramCache]: Analyzing trace with hash 445784932, now seen corresponding path program 1 times [2025-01-09 10:00:29,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:29,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189541564] [2025-01-09 10:00:29,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:29,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:29,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 10:00:29,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 10:00:29,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:29,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:00:29,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:00:29,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189541564] [2025-01-09 10:00:29,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189541564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:29,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:29,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:00:29,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031603919] [2025-01-09 10:00:29,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:29,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:00:29,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:00:29,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:00:29,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:00:29,703 INFO L87 Difference]: Start difference. First operand 297 states and 447 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 10:00:29,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:29,765 INFO L93 Difference]: Finished difference Result 508 states and 763 transitions. [2025-01-09 10:00:29,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:00:29,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 215 [2025-01-09 10:00:29,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:29,769 INFO L225 Difference]: With dead ends: 508 [2025-01-09 10:00:29,770 INFO L226 Difference]: Without dead ends: 306 [2025-01-09 10:00:29,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:00:29,771 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 100 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:00:29,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 278 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:00:29,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-01-09 10:00:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 297. [2025-01-09 10:00:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 189 states have (on average 1.2698412698412698) internal successors, (240), 189 states have internal predecessors, (240), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 10:00:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 444 transitions. [2025-01-09 10:00:29,797 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 444 transitions. Word has length 215 [2025-01-09 10:00:29,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:29,798 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 444 transitions. [2025-01-09 10:00:29,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 10:00:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 444 transitions. [2025-01-09 10:00:29,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 10:00:29,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:29,800 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:29,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:00:29,801 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:29,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:29,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2074175002, now seen corresponding path program 1 times [2025-01-09 10:00:29,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:29,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836927249] [2025-01-09 10:00:29,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:29,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:29,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 10:00:29,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 10:00:29,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:29,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:00:33,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:00:33,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836927249] [2025-01-09 10:00:33,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836927249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:33,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:33,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 10:00:33,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288093314] [2025-01-09 10:00:33,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:33,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 10:00:33,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:00:33,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 10:00:33,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:00:33,690 INFO L87 Difference]: Start difference. First operand 297 states and 444 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:34,952 INFO L93 Difference]: Finished difference Result 354 states and 507 transitions. [2025-01-09 10:00:34,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 10:00:34,953 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-01-09 10:00:34,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:34,956 INFO L225 Difference]: With dead ends: 354 [2025-01-09 10:00:34,956 INFO L226 Difference]: Without dead ends: 352 [2025-01-09 10:00:34,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 10:00:34,957 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 373 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:00:34,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 849 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:00:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-01-09 10:00:34,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 295. [2025-01-09 10:00:34,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 187 states have (on average 1.267379679144385) internal successors, (237), 187 states have internal predecessors, (237), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 10:00:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 441 transitions. [2025-01-09 10:00:35,000 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 441 transitions. Word has length 215 [2025-01-09 10:00:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:35,000 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 441 transitions. [2025-01-09 10:00:35,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 441 transitions. [2025-01-09 10:00:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 10:00:35,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:35,003 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:35,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:00:35,004 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:35,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:35,004 INFO L85 PathProgramCache]: Analyzing trace with hash 657942346, now seen corresponding path program 1 times [2025-01-09 10:00:35,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:35,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087153165] [2025-01-09 10:00:35,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:35,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:35,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 10:00:35,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 10:00:35,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:35,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:00:41,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:00:41,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087153165] [2025-01-09 10:00:41,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087153165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:41,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:41,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 10:00:41,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235227061] [2025-01-09 10:00:41,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:41,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 10:00:41,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:00:41,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 10:00:41,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:00:41,106 INFO L87 Difference]: Start difference. First operand 295 states and 441 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:44,864 INFO L93 Difference]: Finished difference Result 350 states and 503 transitions. [2025-01-09 10:00:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 10:00:44,865 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-01-09 10:00:44,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:44,868 INFO L225 Difference]: With dead ends: 350 [2025-01-09 10:00:44,869 INFO L226 Difference]: Without dead ends: 348 [2025-01-09 10:00:44,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2025-01-09 10:00:44,871 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 328 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:00:44,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1040 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 10:00:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-01-09 10:00:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 298. [2025-01-09 10:00:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 190 states have (on average 1.268421052631579) internal successors, (241), 190 states have internal predecessors, (241), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 10:00:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 445 transitions. [2025-01-09 10:00:44,906 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 445 transitions. Word has length 215 [2025-01-09 10:00:44,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:44,909 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 445 transitions. [2025-01-09 10:00:44,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 445 transitions. [2025-01-09 10:00:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 10:00:44,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:44,912 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:44,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:00:44,912 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:44,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:44,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1776669571, now seen corresponding path program 1 times [2025-01-09 10:00:44,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:44,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100012243] [2025-01-09 10:00:44,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:44,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:44,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 10:00:44,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 10:00:44,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:44,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:00:49,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:00:49,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100012243] [2025-01-09 10:00:49,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100012243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:49,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:49,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:00:49,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463156392] [2025-01-09 10:00:49,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:49,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:00:49,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:00:49,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:00:49,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:00:49,803 INFO L87 Difference]: Start difference. First operand 298 states and 445 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:51,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:51,496 INFO L93 Difference]: Finished difference Result 368 states and 524 transitions. [2025-01-09 10:00:51,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:00:51,497 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-01-09 10:00:51,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:51,500 INFO L225 Difference]: With dead ends: 368 [2025-01-09 10:00:51,500 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 10:00:51,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2025-01-09 10:00:51,501 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 322 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:00:51,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1001 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:00:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 10:00:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 308. [2025-01-09 10:00:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 200 states have (on average 1.27) internal successors, (254), 200 states have internal predecessors, (254), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 10:00:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 458 transitions. [2025-01-09 10:00:51,539 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 458 transitions. Word has length 215 [2025-01-09 10:00:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:51,540 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 458 transitions. [2025-01-09 10:00:51,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:51,540 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 458 transitions. [2025-01-09 10:00:51,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 10:00:51,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:51,542 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:51,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:00:51,543 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:51,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:51,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1838239355, now seen corresponding path program 1 times [2025-01-09 10:00:51,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:51,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526689091] [2025-01-09 10:00:51,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:51,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:51,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 10:00:51,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 10:00:51,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:51,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:00:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:00:55,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:00:55,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526689091] [2025-01-09 10:00:55,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526689091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:00:55,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:00:55,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:00:55,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230562505] [2025-01-09 10:00:55,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:00:55,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:00:55,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:00:55,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:00:55,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:00:55,507 INFO L87 Difference]: Start difference. First operand 308 states and 458 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:00:57,657 INFO L93 Difference]: Finished difference Result 362 states and 518 transitions. [2025-01-09 10:00:57,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 10:00:57,657 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-01-09 10:00:57,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:00:57,660 INFO L225 Difference]: With dead ends: 362 [2025-01-09 10:00:57,660 INFO L226 Difference]: Without dead ends: 360 [2025-01-09 10:00:57,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=280, Invalid=712, Unknown=0, NotChecked=0, Total=992 [2025-01-09 10:00:57,663 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 251 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:00:57,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1025 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 10:00:57,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-09 10:00:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 308. [2025-01-09 10:00:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 200 states have (on average 1.27) internal successors, (254), 200 states have internal predecessors, (254), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 10:00:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 458 transitions. [2025-01-09 10:00:57,695 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 458 transitions. Word has length 215 [2025-01-09 10:00:57,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:00:57,695 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 458 transitions. [2025-01-09 10:00:57,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:00:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 458 transitions. [2025-01-09 10:00:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 10:00:57,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:00:57,697 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:57,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:00:57,697 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:00:57,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:00:57,698 INFO L85 PathProgramCache]: Analyzing trace with hash 178586272, now seen corresponding path program 1 times [2025-01-09 10:00:57,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:00:57,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706221085] [2025-01-09 10:00:57,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:00:57,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:00:57,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 10:00:57,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 10:00:57,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:00:57,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:01:03,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:03,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706221085] [2025-01-09 10:01:03,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706221085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:03,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:03,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 10:01:03,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833089567] [2025-01-09 10:01:03,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:03,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 10:01:03,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:03,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 10:01:03,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-01-09 10:01:03,654 INFO L87 Difference]: Start difference. First operand 308 states and 458 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-01-09 10:01:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:07,135 INFO L93 Difference]: Finished difference Result 350 states and 504 transitions. [2025-01-09 10:01:07,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 10:01:07,135 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 216 [2025-01-09 10:01:07,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:07,138 INFO L225 Difference]: With dead ends: 350 [2025-01-09 10:01:07,138 INFO L226 Difference]: Without dead ends: 348 [2025-01-09 10:01:07,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 10:01:07,139 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 374 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:07,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1256 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 10:01:07,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-01-09 10:01:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 305. [2025-01-09 10:01:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 197 states have (on average 1.2690355329949239) internal successors, (250), 197 states have internal predecessors, (250), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 10:01:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 454 transitions. [2025-01-09 10:01:07,163 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 454 transitions. Word has length 216 [2025-01-09 10:01:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:07,164 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 454 transitions. [2025-01-09 10:01:07,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-01-09 10:01:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 454 transitions. [2025-01-09 10:01:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 10:01:07,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:07,165 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:07,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:01:07,166 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:07,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:07,166 INFO L85 PathProgramCache]: Analyzing trace with hash 858533695, now seen corresponding path program 1 times [2025-01-09 10:01:07,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:07,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430979518] [2025-01-09 10:01:07,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:07,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:07,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 10:01:07,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 10:01:07,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:07,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:01:12,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:12,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430979518] [2025-01-09 10:01:12,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430979518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:12,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:12,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 10:01:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525881096] [2025-01-09 10:01:12,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:12,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 10:01:12,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:12,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 10:01:12,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:01:12,980 INFO L87 Difference]: Start difference. First operand 305 states and 454 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:01:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:18,623 INFO L93 Difference]: Finished difference Result 368 states and 524 transitions. [2025-01-09 10:01:18,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 10:01:18,625 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2025-01-09 10:01:18,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:18,628 INFO L225 Difference]: With dead ends: 368 [2025-01-09 10:01:18,628 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 10:01:18,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=319, Invalid=871, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 10:01:18,630 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 234 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:18,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1141 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 10:01:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 10:01:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 308. [2025-01-09 10:01:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 200 states have (on average 1.27) internal successors, (254), 200 states have internal predecessors, (254), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 10:01:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 458 transitions. [2025-01-09 10:01:18,657 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 458 transitions. Word has length 216 [2025-01-09 10:01:18,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:18,658 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 458 transitions. [2025-01-09 10:01:18,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:01:18,658 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 458 transitions. [2025-01-09 10:01:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 10:01:18,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:18,660 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:18,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:01:18,660 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:18,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:18,662 INFO L85 PathProgramCache]: Analyzing trace with hash -702469211, now seen corresponding path program 1 times [2025-01-09 10:01:18,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:18,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923883306] [2025-01-09 10:01:18,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:18,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 10:01:18,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 10:01:18,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:18,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:01:29,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:29,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923883306] [2025-01-09 10:01:29,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923883306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:29,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:29,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 10:01:29,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983524590] [2025-01-09 10:01:29,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:29,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 10:01:29,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:29,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 10:01:29,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:01:29,014 INFO L87 Difference]: Start difference. First operand 308 states and 458 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)