./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-40.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 fc535726c0c0c24faa254cc99668420ac8f1bc92fcabb29a3cfdd5b58c68005d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:04:51,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:04:51,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:04:51,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:04:51,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:04:51,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:04:51,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:04:51,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:04:51,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:04:51,884 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:04:51,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:04:51,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:04:51,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:04:51,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:04:51,884 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:04:51,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:04:51,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:04:51,885 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:04:51,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:04:51,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:04:51,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:04:51,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:04:51,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:04:51,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:04:51,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:04:51,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:04:51,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:04:51,886 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:04:51,886 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:04:51,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:04:51,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:04:51,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:04:51,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:04:51,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:04:51,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:04:51,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:04:51,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:04:51,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:04:51,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:04:51,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:04:51,887 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:04:51,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:04:51,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:04:51,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:04:51,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:04:51,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:04:51,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:04:51,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:04:51,887 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 -> fc535726c0c0c24faa254cc99668420ac8f1bc92fcabb29a3cfdd5b58c68005d [2025-01-09 10:04:52,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:04:52,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:04:52,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:04:52,095 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:04:52,096 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:04:52,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-40.i [2025-01-09 10:04:53,331 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/772fc3779/f362c39e23754711a89bd870ec6d7c44/FLAGefbd61e64 [2025-01-09 10:04:53,685 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:04:53,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-40.i [2025-01-09 10:04:53,697 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/772fc3779/f362c39e23754711a89bd870ec6d7c44/FLAGefbd61e64 [2025-01-09 10:04:53,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/772fc3779/f362c39e23754711a89bd870ec6d7c44 [2025-01-09 10:04:53,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:04:53,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:04:53,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:04:53,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:04:53,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:04:53,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:04:53" (1/1) ... [2025-01-09 10:04:53,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64787334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:53, skipping insertion in model container [2025-01-09 10:04:53,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:04:53" (1/1) ... [2025-01-09 10:04:53,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:04:53,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-40.i[916,929] [2025-01-09 10:04:53,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:04:53,996 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:04:54,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-40.i[916,929] [2025-01-09 10:04:54,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:04:54,118 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:04:54,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:54 WrapperNode [2025-01-09 10:04:54,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:04:54,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:04:54,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:04:54,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:04:54,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:54" (1/1) ... [2025-01-09 10:04:54,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:54" (1/1) ... [2025-01-09 10:04:54,190 INFO L138 Inliner]: procedures = 26, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 752 [2025-01-09 10:04:54,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:04:54,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:04:54,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:04:54,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:04:54,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:54" (1/1) ... [2025-01-09 10:04:54,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:54" (1/1) ... [2025-01-09 10:04:54,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:54" (1/1) ... [2025-01-09 10:04:54,244 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:04:54,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:54" (1/1) ... [2025-01-09 10:04:54,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:54" (1/1) ... [2025-01-09 10:04:54,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:54" (1/1) ... [2025-01-09 10:04:54,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:54" (1/1) ... [2025-01-09 10:04:54,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:54" (1/1) ... [2025-01-09 10:04:54,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:54" (1/1) ... [2025-01-09 10:04:54,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:54" (1/1) ... [2025-01-09 10:04:54,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:04:54,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:04:54,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:04:54,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:04:54,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:54" (1/1) ... [2025-01-09 10:04:54,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:04:54,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:04:54,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:04:54,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:04:54,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:04:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:04:54,387 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:04:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:04:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:04:54,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:04:54,527 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:04:54,528 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:04:55,432 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-09 10:04:55,433 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:04:55,448 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:04:55,451 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:04:55,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:04:55 BoogieIcfgContainer [2025-01-09 10:04:55,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:04:55,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:04:55,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:04:55,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:04:55,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:04:53" (1/3) ... [2025-01-09 10:04:55,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f46b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:04:55, skipping insertion in model container [2025-01-09 10:04:55,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:54" (2/3) ... [2025-01-09 10:04:55,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f46b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:04:55, skipping insertion in model container [2025-01-09 10:04:55,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:04:55" (3/3) ... [2025-01-09 10:04:55,467 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-40.i [2025-01-09 10:04:55,481 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:04:55,483 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-40.i that has 2 procedures, 316 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:04:55,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:04:55,540 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;@4c18c422, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:04:55,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:04:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 316 states, 216 states have (on average 1.5925925925925926) internal successors, (344), 217 states have internal predecessors, (344), 97 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2025-01-09 10:04:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2025-01-09 10:04:55,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:55,575 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:04:55,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:55,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:55,580 INFO L85 PathProgramCache]: Analyzing trace with hash -129984611, now seen corresponding path program 1 times [2025-01-09 10:04:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:55,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957286181] [2025-01-09 10:04:55,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:55,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:55,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes. [2025-01-09 10:04:55,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements. [2025-01-09 10:04:55,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:55,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:04:56,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:56,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957286181] [2025-01-09 10:04:56,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957286181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:56,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:56,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 10:04:56,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928633283] [2025-01-09 10:04:56,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:56,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:04:56,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:56,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:04:56,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:04:56,192 INFO L87 Difference]: Start difference. First operand has 316 states, 216 states have (on average 1.5925925925925926) internal successors, (344), 217 states have internal predecessors, (344), 97 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:04:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:56,259 INFO L93 Difference]: Finished difference Result 626 states and 1168 transitions. [2025-01-09 10:04:56,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:04:56,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 629 [2025-01-09 10:04:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:56,274 INFO L225 Difference]: With dead ends: 626 [2025-01-09 10:04:56,276 INFO L226 Difference]: Without dead ends: 313 [2025-01-09 10:04:56,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:04:56,285 INFO L435 NwaCegarLoop]: 529 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, 529 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:56,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-01-09 10:04:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2025-01-09 10:04:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 214 states have (on average 1.5654205607476634) internal successors, (335), 214 states have internal predecessors, (335), 97 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2025-01-09 10:04:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 529 transitions. [2025-01-09 10:04:56,368 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 529 transitions. Word has length 629 [2025-01-09 10:04:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:56,373 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 529 transitions. [2025-01-09 10:04:56,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:04:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 529 transitions. [2025-01-09 10:04:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2025-01-09 10:04:56,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:56,385 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:04:56,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 10:04:56,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:56,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:56,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1991594732, now seen corresponding path program 1 times [2025-01-09 10:04:56,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:56,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200951777] [2025-01-09 10:04:56,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:56,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:56,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-01-09 10:04:56,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-01-09 10:04:56,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:56,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:04:57,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:57,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200951777] [2025-01-09 10:04:57,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200951777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:57,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:57,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:57,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681951707] [2025-01-09 10:04:57,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:57,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:57,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:57,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:57,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:57,142 INFO L87 Difference]: Start difference. First operand 313 states and 529 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:04:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:57,220 INFO L93 Difference]: Finished difference Result 933 states and 1581 transitions. [2025-01-09 10:04:57,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:57,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 630 [2025-01-09 10:04:57,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:57,229 INFO L225 Difference]: With dead ends: 933 [2025-01-09 10:04:57,230 INFO L226 Difference]: Without dead ends: 623 [2025-01-09 10:04:57,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:57,233 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 319 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:57,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1050 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-01-09 10:04:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 616. [2025-01-09 10:04:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 419 states have (on average 1.5704057279236276) internal successors, (658), 419 states have internal predecessors, (658), 194 states have call successors, (194), 2 states have call predecessors, (194), 2 states have return successors, (194), 194 states have call predecessors, (194), 194 states have call successors, (194) [2025-01-09 10:04:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 1046 transitions. [2025-01-09 10:04:57,345 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 1046 transitions. Word has length 630 [2025-01-09 10:04:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:57,349 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 1046 transitions. [2025-01-09 10:04:57,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:04:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1046 transitions. [2025-01-09 10:04:57,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-09 10:04:57,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:57,362 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:04:57,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:04:57,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:57,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:57,366 INFO L85 PathProgramCache]: Analyzing trace with hash -656348894, now seen corresponding path program 1 times [2025-01-09 10:04:57,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:57,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54957743] [2025-01-09 10:04:57,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:57,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:57,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-09 10:04:57,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-09 10:04:57,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:57,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:04:57,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:57,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54957743] [2025-01-09 10:04:57,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54957743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:57,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:57,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:57,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534050580] [2025-01-09 10:04:57,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:57,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:57,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:57,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:57,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:57,799 INFO L87 Difference]: Start difference. First operand 616 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:04:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:57,844 INFO L93 Difference]: Finished difference Result 1229 states and 2089 transitions. [2025-01-09 10:04:57,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:57,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-01-09 10:04:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:57,849 INFO L225 Difference]: With dead ends: 1229 [2025-01-09 10:04:57,850 INFO L226 Difference]: Without dead ends: 616 [2025-01-09 10:04:57,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:57,852 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 0 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:57,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1050 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:57,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-01-09 10:04:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2025-01-09 10:04:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 419 states have (on average 1.5656324582338903) internal successors, (656), 419 states have internal predecessors, (656), 194 states have call successors, (194), 2 states have call predecessors, (194), 2 states have return successors, (194), 194 states have call predecessors, (194), 194 states have call successors, (194) [2025-01-09 10:04:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 1044 transitions. [2025-01-09 10:04:57,927 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 1044 transitions. Word has length 631 [2025-01-09 10:04:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:57,928 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 1044 transitions. [2025-01-09 10:04:57,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:04:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1044 transitions. [2025-01-09 10:04:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-09 10:04:57,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:57,937 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:04:57,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:04:57,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:57,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:57,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1465695520, now seen corresponding path program 1 times [2025-01-09 10:04:57,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:57,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804026518] [2025-01-09 10:04:57,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:57,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:57,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-09 10:04:58,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-09 10:04:58,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:58,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:04:58,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:58,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804026518] [2025-01-09 10:04:58,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804026518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:58,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:58,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:58,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076503100] [2025-01-09 10:04:58,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:58,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:58,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:58,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:58,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:58,682 INFO L87 Difference]: Start difference. First operand 616 states and 1044 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:04:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:58,765 INFO L93 Difference]: Finished difference Result 1842 states and 3126 transitions. [2025-01-09 10:04:58,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:58,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-01-09 10:04:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:58,778 INFO L225 Difference]: With dead ends: 1842 [2025-01-09 10:04:58,779 INFO L226 Difference]: Without dead ends: 1229 [2025-01-09 10:04:58,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:58,783 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 348 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:58,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1044 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2025-01-09 10:04:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1227. [2025-01-09 10:04:58,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 834 states have (on average 1.5635491606714629) internal successors, (1304), 834 states have internal predecessors, (1304), 388 states have call successors, (388), 4 states have call predecessors, (388), 4 states have return successors, (388), 388 states have call predecessors, (388), 388 states have call successors, (388) [2025-01-09 10:04:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 2080 transitions. [2025-01-09 10:04:58,959 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 2080 transitions. Word has length 631 [2025-01-09 10:04:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:58,960 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 2080 transitions. [2025-01-09 10:04:58,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:04:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 2080 transitions. [2025-01-09 10:04:58,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-09 10:04:58,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:58,973 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:04:58,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:04:58,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:58,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:58,975 INFO L85 PathProgramCache]: Analyzing trace with hash 508956448, now seen corresponding path program 1 times [2025-01-09 10:04:58,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:58,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668101001] [2025-01-09 10:04:58,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:58,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:59,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-09 10:04:59,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-09 10:04:59,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:59,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:04:59,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:59,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668101001] [2025-01-09 10:04:59,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668101001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:59,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:59,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:59,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246873085] [2025-01-09 10:04:59,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:59,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:59,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:59,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:59,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:59,541 INFO L87 Difference]: Start difference. First operand 1227 states and 2080 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:04:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:59,711 INFO L93 Difference]: Finished difference Result 3671 states and 6226 transitions. [2025-01-09 10:04:59,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:59,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-01-09 10:04:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:59,734 INFO L225 Difference]: With dead ends: 3671 [2025-01-09 10:04:59,734 INFO L226 Difference]: Without dead ends: 2447 [2025-01-09 10:04:59,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:59,741 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 343 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:59,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1231 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2025-01-09 10:05:00,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2445. [2025-01-09 10:05:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 1660 states have (on average 1.5566265060240965) internal successors, (2584), 1660 states have internal predecessors, (2584), 776 states have call successors, (776), 8 states have call predecessors, (776), 8 states have return successors, (776), 776 states have call predecessors, (776), 776 states have call successors, (776) [2025-01-09 10:05:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 4136 transitions. [2025-01-09 10:05:00,037 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 4136 transitions. Word has length 631 [2025-01-09 10:05:00,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:00,038 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 4136 transitions. [2025-01-09 10:05:00,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:05:00,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 4136 transitions. [2025-01-09 10:05:00,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-01-09 10:05:00,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:00,046 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:00,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:05:00,046 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:00,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:00,049 INFO L85 PathProgramCache]: Analyzing trace with hash -527672112, now seen corresponding path program 1 times [2025-01-09 10:05:00,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:00,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858058802] [2025-01-09 10:05:00,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:00,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:00,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-01-09 10:05:00,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-01-09 10:05:00,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:00,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:05:00,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:00,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858058802] [2025-01-09 10:05:00,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858058802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:00,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:00,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:05:00,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533551568] [2025-01-09 10:05:00,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:00,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:05:00,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:00,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:05:00,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:05:00,908 INFO L87 Difference]: Start difference. First operand 2445 states and 4136 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:05:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:01,466 INFO L93 Difference]: Finished difference Result 5760 states and 9684 transitions. [2025-01-09 10:05:01,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:05:01,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 632 [2025-01-09 10:05:01,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:01,497 INFO L225 Difference]: With dead ends: 5760 [2025-01-09 10:05:01,497 INFO L226 Difference]: Without dead ends: 4536 [2025-01-09 10:05:01,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:05:01,504 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 804 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:01,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1865 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:05:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2025-01-09 10:05:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3837. [2025-01-09 10:05:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3837 states, 2804 states have (on average 1.5970042796005706) internal successors, (4478), 2812 states have internal predecessors, (4478), 1016 states have call successors, (1016), 16 states have call predecessors, (1016), 16 states have return successors, (1016), 1008 states have call predecessors, (1016), 1016 states have call successors, (1016) [2025-01-09 10:05:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 6510 transitions. [2025-01-09 10:05:01,874 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 6510 transitions. Word has length 632 [2025-01-09 10:05:01,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:01,875 INFO L471 AbstractCegarLoop]: Abstraction has 3837 states and 6510 transitions. [2025-01-09 10:05:01,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:05:01,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 6510 transitions. [2025-01-09 10:05:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-01-09 10:05:01,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:01,882 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:01,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:05:01,882 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:01,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:01,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1961856850, now seen corresponding path program 1 times [2025-01-09 10:05:01,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:01,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023109764] [2025-01-09 10:05:01,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:01,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:01,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-01-09 10:05:02,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-01-09 10:05:02,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:02,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:05:03,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:03,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023109764] [2025-01-09 10:05:03,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023109764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:03,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:03,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:05:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039824351] [2025-01-09 10:05:03,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:03,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:05:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:03,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:05:03,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:05:03,558 INFO L87 Difference]: Start difference. First operand 3837 states and 6510 transitions. Second operand has 13 states, 13 states have (on average 11.538461538461538) internal successors, (150), 13 states have internal predecessors, (150), 3 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 3 states have call predecessors, (97), 3 states have call successors, (97) [2025-01-09 10:05:06,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:06,824 INFO L93 Difference]: Finished difference Result 20433 states and 34730 transitions. [2025-01-09 10:05:06,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:05:06,825 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.538461538461538) internal successors, (150), 13 states have internal predecessors, (150), 3 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 3 states have call predecessors, (97), 3 states have call successors, (97) Word has length 632 [2025-01-09 10:05:06,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:06,911 INFO L225 Difference]: With dead ends: 20433 [2025-01-09 10:05:06,911 INFO L226 Difference]: Without dead ends: 16599 [2025-01-09 10:05:06,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-01-09 10:05:06,928 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 5620 mSDsluCounter, 3479 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 923 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5620 SdHoareTripleChecker+Valid, 3993 SdHoareTripleChecker+Invalid, 3319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 923 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:06,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5620 Valid, 3993 Invalid, 3319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [923 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 10:05:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16599 states. [2025-01-09 10:05:07,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16599 to 13229. [2025-01-09 10:05:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13229 states, 10588 states have (on average 1.6503588968643748) internal successors, (17474), 10636 states have internal predecessors, (17474), 2576 states have call successors, (2576), 64 states have call predecessors, (2576), 64 states have return successors, (2576), 2528 states have call predecessors, (2576), 2576 states have call successors, (2576) [2025-01-09 10:05:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13229 states to 13229 states and 22626 transitions. [2025-01-09 10:05:07,993 INFO L78 Accepts]: Start accepts. Automaton has 13229 states and 22626 transitions. Word has length 632 [2025-01-09 10:05:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:07,994 INFO L471 AbstractCegarLoop]: Abstraction has 13229 states and 22626 transitions. [2025-01-09 10:05:07,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.538461538461538) internal successors, (150), 13 states have internal predecessors, (150), 3 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 3 states have call predecessors, (97), 3 states have call successors, (97) [2025-01-09 10:05:07,999 INFO L276 IsEmpty]: Start isEmpty. Operand 13229 states and 22626 transitions. [2025-01-09 10:05:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-01-09 10:05:08,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:08,013 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:08,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:05:08,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:08,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:08,014 INFO L85 PathProgramCache]: Analyzing trace with hash -283783086, now seen corresponding path program 1 times [2025-01-09 10:05:08,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:08,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49598257] [2025-01-09 10:05:08,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:08,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:08,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-01-09 10:05:08,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-01-09 10:05:08,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:08,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:05:10,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:10,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49598257] [2025-01-09 10:05:10,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49598257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:10,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:10,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:05:10,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735084959] [2025-01-09 10:05:10,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:10,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:05:10,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:10,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:05:10,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:05:10,315 INFO L87 Difference]: Start difference. First operand 13229 states and 22626 transitions. Second operand has 13 states, 13 states have (on average 11.538461538461538) internal successors, (150), 13 states have internal predecessors, (150), 3 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 3 states have call predecessors, (97), 3 states have call successors, (97) [2025-01-09 10:05:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:17,993 INFO L93 Difference]: Finished difference Result 61754 states and 106009 transitions. [2025-01-09 10:05:17,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 10:05:17,993 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.538461538461538) internal successors, (150), 13 states have internal predecessors, (150), 3 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 3 states have call predecessors, (97), 3 states have call successors, (97) Word has length 632 [2025-01-09 10:05:17,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:18,125 INFO L225 Difference]: With dead ends: 61754 [2025-01-09 10:05:18,125 INFO L226 Difference]: Without dead ends: 48528 [2025-01-09 10:05:18,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=206, Invalid=550, Unknown=0, NotChecked=0, Total=756 [2025-01-09 10:05:18,178 INFO L435 NwaCegarLoop]: 1054 mSDtfsCounter, 5481 mSDsluCounter, 6243 mSDsCounter, 0 mSdLazyCounter, 3991 mSolverCounterSat, 1493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5481 SdHoareTripleChecker+Valid, 7297 SdHoareTripleChecker+Invalid, 5484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1493 IncrementalHoareTripleChecker+Valid, 3991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:18,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5481 Valid, 7297 Invalid, 5484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1493 Valid, 3991 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-01-09 10:05:18,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48528 states. [2025-01-09 10:05:21,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48528 to 29581. [2025-01-09 10:05:21,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29581 states, 23148 states have (on average 1.6183687575600483) internal successors, (37462), 23300 states have internal predecessors, (37462), 6216 states have call successors, (6216), 216 states have call predecessors, (6216), 216 states have return successors, (6216), 6064 states have call predecessors, (6216), 6216 states have call successors, (6216) [2025-01-09 10:05:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29581 states to 29581 states and 49894 transitions. [2025-01-09 10:05:21,369 INFO L78 Accepts]: Start accepts. Automaton has 29581 states and 49894 transitions. Word has length 632 [2025-01-09 10:05:21,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:21,370 INFO L471 AbstractCegarLoop]: Abstraction has 29581 states and 49894 transitions. [2025-01-09 10:05:21,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.538461538461538) internal successors, (150), 13 states have internal predecessors, (150), 3 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 3 states have call predecessors, (97), 3 states have call successors, (97) [2025-01-09 10:05:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 29581 states and 49894 transitions. [2025-01-09 10:05:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-01-09 10:05:21,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:21,399 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:21,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:05:21,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:21,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2017039504, now seen corresponding path program 1 times [2025-01-09 10:05:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:21,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187809243] [2025-01-09 10:05:21,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:21,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-01-09 10:05:21,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-01-09 10:05:21,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:21,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:05:22,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:22,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187809243] [2025-01-09 10:05:22,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187809243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:22,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:22,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:05:22,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230344377] [2025-01-09 10:05:22,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:22,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:05:22,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:22,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:05:22,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:05:22,692 INFO L87 Difference]: Start difference. First operand 29581 states and 49894 transitions. Second operand has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 2 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) [2025-01-09 10:05:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:31,995 INFO L93 Difference]: Finished difference Result 139792 states and 235845 transitions. [2025-01-09 10:05:31,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 10:05:31,998 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 2 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) Word has length 632 [2025-01-09 10:05:31,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:32,318 INFO L225 Difference]: With dead ends: 139792 [2025-01-09 10:05:32,318 INFO L226 Difference]: Without dead ends: 110214 [2025-01-09 10:05:32,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2025-01-09 10:05:32,418 INFO L435 NwaCegarLoop]: 1244 mSDtfsCounter, 2399 mSDsluCounter, 3980 mSDsCounter, 0 mSdLazyCounter, 3694 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 5224 SdHoareTripleChecker+Invalid, 4428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 3694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:32,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 5224 Invalid, 4428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 3694 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 10:05:32,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110214 states. [2025-01-09 10:05:38,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110214 to 58357. [2025-01-09 10:05:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58357 states, 44628 states have (on average 1.5872098234292373) internal successors, (70834), 44988 states have internal predecessors, (70834), 13152 states have call successors, (13152), 576 states have call predecessors, (13152), 576 states have return successors, (13152), 12792 states have call predecessors, (13152), 13152 states have call successors, (13152) [2025-01-09 10:05:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58357 states to 58357 states and 97138 transitions. [2025-01-09 10:05:38,952 INFO L78 Accepts]: Start accepts. Automaton has 58357 states and 97138 transitions. Word has length 632 [2025-01-09 10:05:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:38,954 INFO L471 AbstractCegarLoop]: Abstraction has 58357 states and 97138 transitions. [2025-01-09 10:05:38,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 2 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) [2025-01-09 10:05:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 58357 states and 97138 transitions. [2025-01-09 10:05:38,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-01-09 10:05:38,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:39,000 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:39,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:05:39,001 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:39,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:39,002 INFO L85 PathProgramCache]: Analyzing trace with hash 138918740, now seen corresponding path program 1 times [2025-01-09 10:05:39,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:39,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087528364] [2025-01-09 10:05:39,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:39,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:39,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-01-09 10:05:39,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-01-09 10:05:39,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:39,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:05:39,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:39,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087528364] [2025-01-09 10:05:39,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087528364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:39,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:39,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:39,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541885941] [2025-01-09 10:05:39,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:39,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:39,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:39,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:39,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:39,179 INFO L87 Difference]: Start difference. First operand 58357 states and 97138 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:05:45,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:45,997 INFO L93 Difference]: Finished difference Result 153481 states and 258064 transitions. [2025-01-09 10:05:45,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:45,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 632 [2025-01-09 10:05:45,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:46,314 INFO L225 Difference]: With dead ends: 153481 [2025-01-09 10:05:46,315 INFO L226 Difference]: Without dead ends: 95127 [2025-01-09 10:05:46,462 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:05:46,463 INFO L435 NwaCegarLoop]: 1031 mSDtfsCounter, 519 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:46,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1553 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95127 states. [2025-01-09 10:05:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95127 to 68021. [2025-01-09 10:05:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68021 states, 50828 states have (on average 1.5614621861965845) internal successors, (79366), 51316 states have internal predecessors, (79366), 16488 states have call successors, (16488), 704 states have call predecessors, (16488), 704 states have return successors, (16488), 16000 states have call predecessors, (16488), 16488 states have call successors, (16488) [2025-01-09 10:05:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68021 states to 68021 states and 112342 transitions. [2025-01-09 10:05:53,906 INFO L78 Accepts]: Start accepts. Automaton has 68021 states and 112342 transitions. Word has length 632 [2025-01-09 10:05:53,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:53,907 INFO L471 AbstractCegarLoop]: Abstraction has 68021 states and 112342 transitions. [2025-01-09 10:05:53,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-01-09 10:05:53,908 INFO L276 IsEmpty]: Start isEmpty. Operand 68021 states and 112342 transitions. [2025-01-09 10:05:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-01-09 10:05:53,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:53,956 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:53,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:05:53,957 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:53,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:53,958 INFO L85 PathProgramCache]: Analyzing trace with hash 4905234, now seen corresponding path program 1 times [2025-01-09 10:05:53,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:53,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938565695] [2025-01-09 10:05:53,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:53,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:53,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-01-09 10:05:54,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-01-09 10:05:54,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:54,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-01-09 10:05:54,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:54,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938565695] [2025-01-09 10:05:54,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938565695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:54,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:54,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:05:54,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087622500] [2025-01-09 10:05:54,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:54,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:05:54,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:54,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:05:54,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:05:54,634 INFO L87 Difference]: Start difference. First operand 68021 states and 112342 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97)