./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-94.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_operatoramount_amount250_file-94.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 a92ccd1f56cdb28b8e6efc63e50fd814467549956882758cf5aa04b7a8a9eb25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:30:24,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:30:24,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:30:24,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:30:24,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:30:24,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:30:24,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:30:24,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:30:24,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:30:24,957 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:30:24,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:30:24,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:30:24,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:30:24,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:30:24,958 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:30:24,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:30:24,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:30:24,958 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:30:24,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:30:24,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:30:24,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:30:24,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:30:24,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:30:24,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:30:24,959 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:30:24,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:30:24,959 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:30:24,959 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:30:24,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:30:24,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:30:24,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:30:24,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:30:24,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:30:24,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:30:24,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:30:24,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:30:24,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:30:24,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:30:24,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:30:24,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:30:24,960 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:30:24,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:30:24,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:30:24,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:30:24,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:30:24,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:30:24,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:30:24,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:30:24,962 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 -> a92ccd1f56cdb28b8e6efc63e50fd814467549956882758cf5aa04b7a8a9eb25 [2025-01-09 14:30:25,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:30:25,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:30:25,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:30:25,196 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:30:25,196 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:30:25,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-94.i [2025-01-09 14:30:26,396 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4e532957/1a85782db8884f4fbba551915d58fd98/FLAGed55f2d60 [2025-01-09 14:30:26,715 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:30:26,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-94.i [2025-01-09 14:30:26,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4e532957/1a85782db8884f4fbba551915d58fd98/FLAGed55f2d60 [2025-01-09 14:30:26,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4e532957/1a85782db8884f4fbba551915d58fd98 [2025-01-09 14:30:26,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:30:26,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:30:26,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:30:26,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:30:26,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:30:26,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:30:26" (1/1) ... [2025-01-09 14:30:26,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d97fe48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:26, skipping insertion in model container [2025-01-09 14:30:26,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:30:26" (1/1) ... [2025-01-09 14:30:27,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:30:27,101 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_operatoramount_amount250_file-94.i[916,929] [2025-01-09 14:30:27,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:30:27,208 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:30:27,215 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_operatoramount_amount250_file-94.i[916,929] [2025-01-09 14:30:27,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:30:27,279 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:30:27,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:27 WrapperNode [2025-01-09 14:30:27,279 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:30:27,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:30:27,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:30:27,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:30:27,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:27" (1/1) ... [2025-01-09 14:30:27,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:27" (1/1) ... [2025-01-09 14:30:27,343 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 493 [2025-01-09 14:30:27,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:30:27,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:30:27,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:30:27,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:30:27,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:27" (1/1) ... [2025-01-09 14:30:27,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:27" (1/1) ... [2025-01-09 14:30:27,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:27" (1/1) ... [2025-01-09 14:30:27,404 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 14:30:27,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:27" (1/1) ... [2025-01-09 14:30:27,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:27" (1/1) ... [2025-01-09 14:30:27,421 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:27" (1/1) ... [2025-01-09 14:30:27,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:27" (1/1) ... [2025-01-09 14:30:27,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:27" (1/1) ... [2025-01-09 14:30:27,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:27" (1/1) ... [2025-01-09 14:30:27,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:27" (1/1) ... [2025-01-09 14:30:27,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:30:27,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:30:27,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:30:27,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:30:27,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:27" (1/1) ... [2025-01-09 14:30:27,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:30:27,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:27,491 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 14:30:27,494 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 14:30:27,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:30:27,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:30:27,512 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:30:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:30:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:30:27,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:30:27,606 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:30:27,607 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:30:28,293 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-01-09 14:30:28,293 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:30:28,302 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:30:28,303 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:30:28,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:30:28 BoogieIcfgContainer [2025-01-09 14:30:28,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:30:28,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:30:28,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:30:28,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:30:28,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:30:26" (1/3) ... [2025-01-09 14:30:28,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175d7560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:30:28, skipping insertion in model container [2025-01-09 14:30:28,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:30:27" (2/3) ... [2025-01-09 14:30:28,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175d7560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:30:28, skipping insertion in model container [2025-01-09 14:30:28,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:30:28" (3/3) ... [2025-01-09 14:30:28,310 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-94.i [2025-01-09 14:30:28,319 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:30:28,322 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-94.i that has 2 procedures, 191 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:30:28,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:30:28,386 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;@4b66e3e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:30:28,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:30:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 149 states have (on average 1.5100671140939597) internal successors, (225), 150 states have internal predecessors, (225), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 14:30:28,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-01-09 14:30:28,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:28,433 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:30:28,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:28,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:28,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1367521726, now seen corresponding path program 1 times [2025-01-09 14:30:28,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:28,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145041393] [2025-01-09 14:30:28,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:28,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:28,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-09 14:30:28,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-09 14:30:28,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:28,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-01-09 14:30:28,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:28,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145041393] [2025-01-09 14:30:28,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145041393] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:28,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058280518] [2025-01-09 14:30:28,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:28,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:28,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:28,810 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:30:28,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:30:28,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-09 14:30:29,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-09 14:30:29,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:29,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:29,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:30:29,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:30:29,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-01-09 14:30:29,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:30:29,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058280518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:29,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:30:29,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:30:29,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379696539] [2025-01-09 14:30:29,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:29,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:30:29,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:29,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:30:29,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:30:29,091 INFO L87 Difference]: Start difference. First operand has 191 states, 149 states have (on average 1.5100671140939597) internal successors, (225), 150 states have internal predecessors, (225), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 14:30:29,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:29,117 INFO L93 Difference]: Finished difference Result 376 states and 640 transitions. [2025-01-09 14:30:29,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:30:29,118 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 275 [2025-01-09 14:30:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:29,124 INFO L225 Difference]: With dead ends: 376 [2025-01-09 14:30:29,124 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 14:30:29,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 276 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 14:30:29,130 INFO L435 NwaCegarLoop]: 298 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, 298 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 14:30:29,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:30:29,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 14:30:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-01-09 14:30:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 147 states have (on average 1.4965986394557824) internal successors, (220), 147 states have internal predecessors, (220), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 14:30:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 298 transitions. [2025-01-09 14:30:29,169 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 298 transitions. Word has length 275 [2025-01-09 14:30:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:29,169 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 298 transitions. [2025-01-09 14:30:29,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 14:30:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 298 transitions. [2025-01-09 14:30:29,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-01-09 14:30:29,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:29,173 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:30:29,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:30:29,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:30:29,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:29,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:29,375 INFO L85 PathProgramCache]: Analyzing trace with hash -31933580, now seen corresponding path program 1 times [2025-01-09 14:30:29,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:29,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669404793] [2025-01-09 14:30:29,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:29,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:29,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-01-09 14:30:29,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-01-09 14:30:29,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:29,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:30:30,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:30,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669404793] [2025-01-09 14:30:30,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669404793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:30,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:30,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:30:30,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406406159] [2025-01-09 14:30:30,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:30,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:30:30,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:30,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:30:30,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:30:30,433 INFO L87 Difference]: Start difference. First operand 188 states and 298 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:31,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:31,366 INFO L93 Difference]: Finished difference Result 845 states and 1337 transitions. [2025-01-09 14:30:31,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:30:31,367 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 275 [2025-01-09 14:30:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:31,375 INFO L225 Difference]: With dead ends: 845 [2025-01-09 14:30:31,375 INFO L226 Difference]: Without dead ends: 660 [2025-01-09 14:30:31,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:30:31,378 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 758 mSDsluCounter, 2093 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:31,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 2516 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:30:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-09 14:30:31,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 452. [2025-01-09 14:30:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 371 states have (on average 1.522911051212938) internal successors, (565), 371 states have internal predecessors, (565), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 14:30:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 721 transitions. [2025-01-09 14:30:31,417 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 721 transitions. Word has length 275 [2025-01-09 14:30:31,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:31,418 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 721 transitions. [2025-01-09 14:30:31,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 721 transitions. [2025-01-09 14:30:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-09 14:30:31,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:31,421 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:30:31,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:30:31,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:31,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash 651449765, now seen corresponding path program 1 times [2025-01-09 14:30:31,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:31,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204151645] [2025-01-09 14:30:31,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:31,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:31,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 14:30:31,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 14:30:31,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:31,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:30:32,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:32,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204151645] [2025-01-09 14:30:32,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204151645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:32,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:32,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:30:32,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506939266] [2025-01-09 14:30:32,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:32,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:30:32,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:32,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:30:32,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:30:32,279 INFO L87 Difference]: Start difference. First operand 452 states and 721 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:33,099 INFO L93 Difference]: Finished difference Result 2362 states and 3774 transitions. [2025-01-09 14:30:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 14:30:33,100 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 276 [2025-01-09 14:30:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:33,112 INFO L225 Difference]: With dead ends: 2362 [2025-01-09 14:30:33,113 INFO L226 Difference]: Without dead ends: 2177 [2025-01-09 14:30:33,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2025-01-09 14:30:33,118 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 2233 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2233 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:33,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2233 Valid, 2763 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:30:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2025-01-09 14:30:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 1294. [2025-01-09 14:30:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1075 states have (on average 1.5293023255813953) internal successors, (1644), 1077 states have internal predecessors, (1644), 211 states have call successors, (211), 7 states have call predecessors, (211), 7 states have return successors, (211), 209 states have call predecessors, (211), 211 states have call successors, (211) [2025-01-09 14:30:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 2066 transitions. [2025-01-09 14:30:33,227 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 2066 transitions. Word has length 276 [2025-01-09 14:30:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:33,228 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 2066 transitions. [2025-01-09 14:30:33,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2066 transitions. [2025-01-09 14:30:33,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-09 14:30:33,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:33,250 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:30:33,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:30:33,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:33,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:33,251 INFO L85 PathProgramCache]: Analyzing trace with hash 791998375, now seen corresponding path program 1 times [2025-01-09 14:30:33,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:33,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842948300] [2025-01-09 14:30:33,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:33,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:33,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 14:30:33,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 14:30:33,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:33,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:30:35,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:35,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842948300] [2025-01-09 14:30:35,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842948300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:35,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:35,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 14:30:35,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426561727] [2025-01-09 14:30:35,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:35,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:30:35,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:35,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:30:35,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:30:35,242 INFO L87 Difference]: Start difference. First operand 1294 states and 2066 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 14:30:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:40,342 INFO L93 Difference]: Finished difference Result 8520 states and 13226 transitions. [2025-01-09 14:30:40,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-09 14:30:40,343 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 276 [2025-01-09 14:30:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:40,379 INFO L225 Difference]: With dead ends: 8520 [2025-01-09 14:30:40,380 INFO L226 Difference]: Without dead ends: 7311 [2025-01-09 14:30:40,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=717, Invalid=2253, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 14:30:40,387 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 4426 mSDsluCounter, 3364 mSDsCounter, 0 mSdLazyCounter, 3001 mSolverCounterSat, 565 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4426 SdHoareTripleChecker+Valid, 3810 SdHoareTripleChecker+Invalid, 3566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 565 IncrementalHoareTripleChecker+Valid, 3001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:40,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4426 Valid, 3810 Invalid, 3566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [565 Valid, 3001 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 14:30:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7311 states. [2025-01-09 14:30:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7311 to 2975. [2025-01-09 14:30:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2500 states have (on average 1.5252) internal successors, (3813), 2517 states have internal predecessors, (3813), 451 states have call successors, (451), 23 states have call predecessors, (451), 23 states have return successors, (451), 434 states have call predecessors, (451), 451 states have call successors, (451) [2025-01-09 14:30:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4715 transitions. [2025-01-09 14:30:40,658 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4715 transitions. Word has length 276 [2025-01-09 14:30:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:40,659 INFO L471 AbstractCegarLoop]: Abstraction has 2975 states and 4715 transitions. [2025-01-09 14:30:40,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 14:30:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4715 transitions. [2025-01-09 14:30:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-09 14:30:40,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:40,664 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:30:40,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:30:40,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:40,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:40,666 INFO L85 PathProgramCache]: Analyzing trace with hash 227884978, now seen corresponding path program 1 times [2025-01-09 14:30:40,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:40,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017024349] [2025-01-09 14:30:40,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:40,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:40,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 14:30:40,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 14:30:40,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:40,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:30:43,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:43,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017024349] [2025-01-09 14:30:43,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017024349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:43,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:43,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:30:43,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535814518] [2025-01-09 14:30:43,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:43,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:30:43,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:43,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:30:43,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:30:43,368 INFO L87 Difference]: Start difference. First operand 2975 states and 4715 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:46,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:46,420 INFO L93 Difference]: Finished difference Result 10283 states and 16190 transitions. [2025-01-09 14:30:46,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 14:30:46,421 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 276 [2025-01-09 14:30:46,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:46,450 INFO L225 Difference]: With dead ends: 10283 [2025-01-09 14:30:46,450 INFO L226 Difference]: Without dead ends: 7608 [2025-01-09 14:30:46,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:30:46,459 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 1653 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1653 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:46,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1653 Valid, 1885 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 14:30:46,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7608 states. [2025-01-09 14:30:46,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7608 to 6777. [2025-01-09 14:30:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6777 states, 6236 states have (on average 1.5476266837716486) internal successors, (9651), 6266 states have internal predecessors, (9651), 503 states have call successors, (503), 37 states have call predecessors, (503), 37 states have return successors, (503), 473 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 14:30:46,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6777 states to 6777 states and 10657 transitions. [2025-01-09 14:30:46,723 INFO L78 Accepts]: Start accepts. Automaton has 6777 states and 10657 transitions. Word has length 276 [2025-01-09 14:30:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:46,723 INFO L471 AbstractCegarLoop]: Abstraction has 6777 states and 10657 transitions. [2025-01-09 14:30:46,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:46,726 INFO L276 IsEmpty]: Start isEmpty. Operand 6777 states and 10657 transitions. [2025-01-09 14:30:46,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-09 14:30:46,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:46,734 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:30:46,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:30:46,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:46,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:46,736 INFO L85 PathProgramCache]: Analyzing trace with hash -720357533, now seen corresponding path program 1 times [2025-01-09 14:30:46,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:46,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325990618] [2025-01-09 14:30:46,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:46,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:46,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 14:30:46,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 14:30:46,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:46,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:30:47,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:47,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325990618] [2025-01-09 14:30:47,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325990618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:47,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:47,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 14:30:47,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285351128] [2025-01-09 14:30:47,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:47,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:30:47,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:47,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:30:47,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:30:47,404 INFO L87 Difference]: Start difference. First operand 6777 states and 10657 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 14:30:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:48,897 INFO L93 Difference]: Finished difference Result 9291 states and 14420 transitions. [2025-01-09 14:30:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 14:30:48,897 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 276 [2025-01-09 14:30:48,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:48,929 INFO L225 Difference]: With dead ends: 9291 [2025-01-09 14:30:48,932 INFO L226 Difference]: Without dead ends: 8055 [2025-01-09 14:30:48,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2025-01-09 14:30:48,940 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 2336 mSDsluCounter, 2297 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2336 SdHoareTripleChecker+Valid, 2669 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:48,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2336 Valid, 2669 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:30:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8055 states. [2025-01-09 14:30:49,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8055 to 7500. [2025-01-09 14:30:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7500 states, 6891 states have (on average 1.5386736322739805) internal successors, (10603), 6929 states have internal predecessors, (10603), 559 states have call successors, (559), 49 states have call predecessors, (559), 49 states have return successors, (559), 521 states have call predecessors, (559), 559 states have call successors, (559) [2025-01-09 14:30:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7500 states to 7500 states and 11721 transitions. [2025-01-09 14:30:49,270 INFO L78 Accepts]: Start accepts. Automaton has 7500 states and 11721 transitions. Word has length 276 [2025-01-09 14:30:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:49,271 INFO L471 AbstractCegarLoop]: Abstraction has 7500 states and 11721 transitions. [2025-01-09 14:30:49,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 14:30:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 7500 states and 11721 transitions. [2025-01-09 14:30:49,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-09 14:30:49,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:49,286 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:30:49,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:30:49,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:49,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:49,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1397938077, now seen corresponding path program 1 times [2025-01-09 14:30:49,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:49,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898146226] [2025-01-09 14:30:49,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:49,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:49,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 14:30:49,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 14:30:49,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:49,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:30:49,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:49,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898146226] [2025-01-09 14:30:49,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898146226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:49,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:49,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:30:49,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685533522] [2025-01-09 14:30:49,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:49,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:30:49,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:49,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:30:49,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:30:49,748 INFO L87 Difference]: Start difference. First operand 7500 states and 11721 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:50,499 INFO L93 Difference]: Finished difference Result 13247 states and 20700 transitions. [2025-01-09 14:30:50,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:30:50,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 276 [2025-01-09 14:30:50,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:50,525 INFO L225 Difference]: With dead ends: 13247 [2025-01-09 14:30:50,525 INFO L226 Difference]: Without dead ends: 11985 [2025-01-09 14:30:50,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:30:50,529 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 660 mSDsluCounter, 1939 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 2368 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:50,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 2368 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:30:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11985 states. [2025-01-09 14:30:50,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11985 to 7426. [2025-01-09 14:30:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7426 states, 6837 states have (on average 1.549363756033348) internal successors, (10593), 6871 states have internal predecessors, (10593), 543 states have call successors, (543), 45 states have call predecessors, (543), 45 states have return successors, (543), 509 states have call predecessors, (543), 543 states have call successors, (543) [2025-01-09 14:30:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 11679 transitions. [2025-01-09 14:30:50,826 INFO L78 Accepts]: Start accepts. Automaton has 7426 states and 11679 transitions. Word has length 276 [2025-01-09 14:30:50,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:50,826 INFO L471 AbstractCegarLoop]: Abstraction has 7426 states and 11679 transitions. [2025-01-09 14:30:50,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 7426 states and 11679 transitions. [2025-01-09 14:30:50,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-09 14:30:50,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:50,837 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:30:50,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:30:50,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:50,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1257389467, now seen corresponding path program 1 times [2025-01-09 14:30:50,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:50,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342702687] [2025-01-09 14:30:50,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:50,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:50,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 14:30:50,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 14:30:50,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:50,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:30:51,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:51,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342702687] [2025-01-09 14:30:51,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342702687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:51,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:51,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:30:51,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930811248] [2025-01-09 14:30:51,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:51,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:30:51,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:51,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:30:51,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:30:51,134 INFO L87 Difference]: Start difference. First operand 7426 states and 11679 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:51,691 INFO L93 Difference]: Finished difference Result 14853 states and 23330 transitions. [2025-01-09 14:30:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:30:51,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 276 [2025-01-09 14:30:51,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:51,709 INFO L225 Difference]: With dead ends: 14853 [2025-01-09 14:30:51,709 INFO L226 Difference]: Without dead ends: 7508 [2025-01-09 14:30:51,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:30:51,720 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 229 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:51,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1245 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:30:51,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7508 states. [2025-01-09 14:30:52,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7508 to 7426. [2025-01-09 14:30:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7426 states, 6837 states have (on average 1.5492174930525084) internal successors, (10592), 6871 states have internal predecessors, (10592), 543 states have call successors, (543), 45 states have call predecessors, (543), 45 states have return successors, (543), 509 states have call predecessors, (543), 543 states have call successors, (543) [2025-01-09 14:30:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 11678 transitions. [2025-01-09 14:30:52,037 INFO L78 Accepts]: Start accepts. Automaton has 7426 states and 11678 transitions. Word has length 276 [2025-01-09 14:30:52,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:52,038 INFO L471 AbstractCegarLoop]: Abstraction has 7426 states and 11678 transitions. [2025-01-09 14:30:52,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:52,038 INFO L276 IsEmpty]: Start isEmpty. Operand 7426 states and 11678 transitions. [2025-01-09 14:30:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-01-09 14:30:52,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:52,047 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:30:52,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:30:52,047 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:52,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:52,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1553181336, now seen corresponding path program 1 times [2025-01-09 14:30:52,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:52,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490899764] [2025-01-09 14:30:52,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:52,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-09 14:30:52,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-09 14:30:52,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:52,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:30:52,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:52,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490899764] [2025-01-09 14:30:52,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490899764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:52,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:52,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:30:52,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457447533] [2025-01-09 14:30:52,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:52,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:30:52,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:52,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:30:52,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:30:52,234 INFO L87 Difference]: Start difference. First operand 7426 states and 11678 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:52,618 INFO L93 Difference]: Finished difference Result 14853 states and 23329 transitions. [2025-01-09 14:30:52,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:30:52,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 277 [2025-01-09 14:30:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:52,637 INFO L225 Difference]: With dead ends: 14853 [2025-01-09 14:30:52,638 INFO L226 Difference]: Without dead ends: 7508 [2025-01-09 14:30:52,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:30:52,649 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 319 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:52,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1014 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:30:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7508 states. [2025-01-09 14:30:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7508 to 7426. [2025-01-09 14:30:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7426 states, 6837 states have (on average 1.549071230071669) internal successors, (10591), 6871 states have internal predecessors, (10591), 543 states have call successors, (543), 45 states have call predecessors, (543), 45 states have return successors, (543), 509 states have call predecessors, (543), 543 states have call successors, (543) [2025-01-09 14:30:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 11677 transitions. [2025-01-09 14:30:52,952 INFO L78 Accepts]: Start accepts. Automaton has 7426 states and 11677 transitions. Word has length 277 [2025-01-09 14:30:52,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:52,963 INFO L471 AbstractCegarLoop]: Abstraction has 7426 states and 11677 transitions. [2025-01-09 14:30:52,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:52,964 INFO L276 IsEmpty]: Start isEmpty. Operand 7426 states and 11677 transitions. [2025-01-09 14:30:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-01-09 14:30:52,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:52,977 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:30:52,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:30:52,977 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:52,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:52,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1997082010, now seen corresponding path program 1 times [2025-01-09 14:30:52,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:52,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137617822] [2025-01-09 14:30:52,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:52,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:53,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-09 14:30:53,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-09 14:30:53,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:53,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:30:53,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:53,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137617822] [2025-01-09 14:30:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137617822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:53,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:53,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:30:53,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101562396] [2025-01-09 14:30:53,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:53,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:30:53,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:53,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:30:53,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:30:53,287 INFO L87 Difference]: Start difference. First operand 7426 states and 11677 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:53,855 INFO L93 Difference]: Finished difference Result 23945 states and 37662 transitions. [2025-01-09 14:30:53,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:30:53,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 277 [2025-01-09 14:30:53,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:53,898 INFO L225 Difference]: With dead ends: 23945 [2025-01-09 14:30:53,898 INFO L226 Difference]: Without dead ends: 16632 [2025-01-09 14:30:53,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:30:53,908 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 458 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:53,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 934 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:30:53,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16632 states. [2025-01-09 14:30:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16632 to 9617. [2025-01-09 14:30:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9617 states, 8712 states have (on average 1.542584940312213) internal successors, (13439), 8766 states have internal predecessors, (13439), 839 states have call successors, (839), 65 states have call predecessors, (839), 65 states have return successors, (839), 785 states have call predecessors, (839), 839 states have call successors, (839) [2025-01-09 14:30:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9617 states to 9617 states and 15117 transitions. [2025-01-09 14:30:54,425 INFO L78 Accepts]: Start accepts. Automaton has 9617 states and 15117 transitions. Word has length 277 [2025-01-09 14:30:54,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:54,426 INFO L471 AbstractCegarLoop]: Abstraction has 9617 states and 15117 transitions. [2025-01-09 14:30:54,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 9617 states and 15117 transitions. [2025-01-09 14:30:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-01-09 14:30:54,436 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:54,436 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:30:54,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:30:54,437 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:54,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:54,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1337550488, now seen corresponding path program 1 times [2025-01-09 14:30:54,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:54,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428500078] [2025-01-09 14:30:54,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:54,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:54,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-09 14:30:54,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-09 14:30:54,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:54,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:30:54,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:54,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428500078] [2025-01-09 14:30:54,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428500078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:54,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:54,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:30:54,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658683200] [2025-01-09 14:30:54,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:54,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:30:54,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:54,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:30:54,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:30:54,792 INFO L87 Difference]: Start difference. First operand 9617 states and 15117 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:55,612 INFO L93 Difference]: Finished difference Result 26104 states and 41038 transitions. [2025-01-09 14:30:55,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:30:55,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 277 [2025-01-09 14:30:55,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:55,647 INFO L225 Difference]: With dead ends: 26104 [2025-01-09 14:30:55,647 INFO L226 Difference]: Without dead ends: 16632 [2025-01-09 14:30:55,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:30:55,657 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 460 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:55,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1499 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:30:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16632 states. [2025-01-09 14:30:55,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16632 to 9617. [2025-01-09 14:30:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9617 states, 8712 states have (on average 1.54143709825528) internal successors, (13429), 8766 states have internal predecessors, (13429), 839 states have call successors, (839), 65 states have call predecessors, (839), 65 states have return successors, (839), 785 states have call predecessors, (839), 839 states have call successors, (839) [2025-01-09 14:30:56,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9617 states to 9617 states and 15107 transitions. [2025-01-09 14:30:56,018 INFO L78 Accepts]: Start accepts. Automaton has 9617 states and 15107 transitions. Word has length 277 [2025-01-09 14:30:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:56,020 INFO L471 AbstractCegarLoop]: Abstraction has 9617 states and 15107 transitions. [2025-01-09 14:30:56,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 9617 states and 15107 transitions. [2025-01-09 14:30:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-01-09 14:30:56,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:56,027 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:30:56,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:30:56,028 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:56,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:56,028 INFO L85 PathProgramCache]: Analyzing trace with hash 151714844, now seen corresponding path program 1 times [2025-01-09 14:30:56,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:56,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643254716] [2025-01-09 14:30:56,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:56,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:56,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-09 14:30:56,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-09 14:30:56,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:56,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:30:56,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:56,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643254716] [2025-01-09 14:30:56,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643254716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:56,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:56,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:30:56,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288449658] [2025-01-09 14:30:56,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:56,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:30:56,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:56,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:30:56,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:30:56,674 INFO L87 Difference]: Start difference. First operand 9617 states and 15107 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:58,691 INFO L93 Difference]: Finished difference Result 36190 states and 56695 transitions. [2025-01-09 14:30:58,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:30:58,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 277 [2025-01-09 14:30:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:58,740 INFO L225 Difference]: With dead ends: 36190 [2025-01-09 14:30:58,740 INFO L226 Difference]: Without dead ends: 30182 [2025-01-09 14:30:58,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:30:58,755 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 2091 mSDsluCounter, 2355 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2091 SdHoareTripleChecker+Valid, 2758 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:58,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2091 Valid, 2758 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:30:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30182 states. [2025-01-09 14:30:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30182 to 22061. [2025-01-09 14:30:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22061 states, 20556 states have (on average 1.5689822922747616) internal successors, (32252), 20656 states have internal predecessors, (32252), 1383 states have call successors, (1383), 121 states have call predecessors, (1383), 121 states have return successors, (1383), 1283 states have call predecessors, (1383), 1383 states have call successors, (1383) [2025-01-09 14:30:59,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22061 states to 22061 states and 35018 transitions. [2025-01-09 14:30:59,755 INFO L78 Accepts]: Start accepts. Automaton has 22061 states and 35018 transitions. Word has length 277 [2025-01-09 14:30:59,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:59,756 INFO L471 AbstractCegarLoop]: Abstraction has 22061 states and 35018 transitions. [2025-01-09 14:30:59,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:30:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 22061 states and 35018 transitions. [2025-01-09 14:30:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-01-09 14:30:59,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:59,767 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:30:59,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:30:59,767 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:59,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:59,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1653723490, now seen corresponding path program 1 times [2025-01-09 14:30:59,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:59,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334749051] [2025-01-09 14:30:59,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:59,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:59,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-09 14:30:59,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-09 14:30:59,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:59,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:31:02,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:31:02,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334749051] [2025-01-09 14:31:02,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334749051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:02,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:31:02,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:31:02,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850585396] [2025-01-09 14:31:02,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:02,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:31:02,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:31:02,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:31:02,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:31:02,172 INFO L87 Difference]: Start difference. First operand 22061 states and 35018 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:31:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:04,287 INFO L93 Difference]: Finished difference Result 30822 states and 48580 transitions. [2025-01-09 14:31:04,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:31:04,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 277 [2025-01-09 14:31:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:04,329 INFO L225 Difference]: With dead ends: 30822 [2025-01-09 14:31:04,329 INFO L226 Difference]: Without dead ends: 25916 [2025-01-09 14:31:04,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:31:04,343 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1419 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 2313 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:04,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 2313 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:31:04,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25916 states. [2025-01-09 14:31:05,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25916 to 22411. [2025-01-09 14:31:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22411 states, 20906 states have (on average 1.5676360853343538) internal successors, (32773), 21006 states have internal predecessors, (32773), 1383 states have call successors, (1383), 121 states have call predecessors, (1383), 121 states have return successors, (1383), 1283 states have call predecessors, (1383), 1383 states have call successors, (1383) [2025-01-09 14:31:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22411 states to 22411 states and 35539 transitions. [2025-01-09 14:31:05,092 INFO L78 Accepts]: Start accepts. Automaton has 22411 states and 35539 transitions. Word has length 277 [2025-01-09 14:31:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:05,093 INFO L471 AbstractCegarLoop]: Abstraction has 22411 states and 35539 transitions. [2025-01-09 14:31:05,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:31:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 22411 states and 35539 transitions. [2025-01-09 14:31:05,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-09 14:31:05,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:05,105 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:31:05,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:31:05,105 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:05,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:05,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1039790564, now seen corresponding path program 1 times [2025-01-09 14:31:05,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:05,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664089990] [2025-01-09 14:31:05,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:05,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:05,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-09 14:31:05,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-09 14:31:05,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:05,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:31:05,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:31:05,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664089990] [2025-01-09 14:31:05,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664089990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:05,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:31:05,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:31:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327915504] [2025-01-09 14:31:05,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:05,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:31:05,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:31:05,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:31:05,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:31:05,697 INFO L87 Difference]: Start difference. First operand 22411 states and 35539 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-01-09 14:31:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:07,933 INFO L93 Difference]: Finished difference Result 49633 states and 78552 transitions. [2025-01-09 14:31:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:31:07,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 278 [2025-01-09 14:31:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:07,987 INFO L225 Difference]: With dead ends: 49633 [2025-01-09 14:31:07,987 INFO L226 Difference]: Without dead ends: 33034 [2025-01-09 14:31:08,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:31:08,004 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 1452 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:08,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1452 Valid, 772 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:31:08,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33034 states. [2025-01-09 14:31:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33034 to 15914. [2025-01-09 14:31:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15914 states, 14861 states have (on average 1.5732454074422986) internal successors, (23380), 14903 states have internal predecessors, (23380), 955 states have call successors, (955), 97 states have call predecessors, (955), 97 states have return successors, (955), 913 states have call predecessors, (955), 955 states have call successors, (955) [2025-01-09 14:31:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15914 states to 15914 states and 25290 transitions. [2025-01-09 14:31:08,731 INFO L78 Accepts]: Start accepts. Automaton has 15914 states and 25290 transitions. Word has length 278 [2025-01-09 14:31:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:08,731 INFO L471 AbstractCegarLoop]: Abstraction has 15914 states and 25290 transitions. [2025-01-09 14:31:08,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-01-09 14:31:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 15914 states and 25290 transitions. [2025-01-09 14:31:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-09 14:31:08,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:08,740 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:31:08,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:31:08,740 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:08,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash -380865529, now seen corresponding path program 1 times [2025-01-09 14:31:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:08,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480100744] [2025-01-09 14:31:08,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:08,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:08,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-09 14:31:08,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-09 14:31:08,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:08,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:31:13,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:31:13,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480100744] [2025-01-09 14:31:13,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480100744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:13,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:31:13,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 14:31:13,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994978328] [2025-01-09 14:31:13,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:13,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:31:13,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:31:13,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:31:13,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:31:13,422 INFO L87 Difference]: Start difference. First operand 15914 states and 25290 transitions. Second operand has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-01-09 14:31:19,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:19,923 INFO L93 Difference]: Finished difference Result 24238 states and 38289 transitions. [2025-01-09 14:31:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:31:19,923 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 278 [2025-01-09 14:31:19,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:19,960 INFO L225 Difference]: With dead ends: 24238 [2025-01-09 14:31:19,960 INFO L226 Difference]: Without dead ends: 22461 [2025-01-09 14:31:19,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2025-01-09 14:31:19,972 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 6231 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 2862 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6231 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 3157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 2862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:19,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6231 Valid, 2431 Invalid, 3157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 2862 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 14:31:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22461 states. [2025-01-09 14:31:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22461 to 16025. [2025-01-09 14:31:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16025 states, 14972 states have (on average 1.572602190756078) internal successors, (23545), 15014 states have internal predecessors, (23545), 955 states have call successors, (955), 97 states have call predecessors, (955), 97 states have return successors, (955), 913 states have call predecessors, (955), 955 states have call successors, (955) [2025-01-09 14:31:20,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16025 states to 16025 states and 25455 transitions. [2025-01-09 14:31:20,682 INFO L78 Accepts]: Start accepts. Automaton has 16025 states and 25455 transitions. Word has length 278 [2025-01-09 14:31:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:20,682 INFO L471 AbstractCegarLoop]: Abstraction has 16025 states and 25455 transitions. [2025-01-09 14:31:20,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-01-09 14:31:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 16025 states and 25455 transitions. [2025-01-09 14:31:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-09 14:31:20,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:20,692 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:31:20,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:31:20,693 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:20,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2108663433, now seen corresponding path program 1 times [2025-01-09 14:31:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:20,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340078514] [2025-01-09 14:31:20,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:20,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:20,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-09 14:31:20,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-09 14:31:20,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:31:20,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:31:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:31:25,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:31:25,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340078514] [2025-01-09 14:31:25,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340078514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:31:25,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:31:25,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 14:31:25,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768870247] [2025-01-09 14:31:25,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:31:25,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:31:25,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:31:25,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:31:25,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:31:25,548 INFO L87 Difference]: Start difference. First operand 16025 states and 25455 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-01-09 14:31:38,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 14:31:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:31:40,715 INFO L93 Difference]: Finished difference Result 44233 states and 69869 transitions. [2025-01-09 14:31:40,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 14:31:40,715 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 278 [2025-01-09 14:31:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:31:40,761 INFO L225 Difference]: With dead ends: 44233 [2025-01-09 14:31:40,761 INFO L226 Difference]: Without dead ends: 32445 [2025-01-09 14:31:40,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=551, Invalid=1171, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 14:31:40,782 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 4472 mSDsluCounter, 2680 mSDsCounter, 0 mSdLazyCounter, 3970 mSolverCounterSat, 293 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4472 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 4264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 3970 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:31:40,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4472 Valid, 3134 Invalid, 4264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 3970 Invalid, 1 Unknown, 0 Unchecked, 9.7s Time] [2025-01-09 14:31:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32445 states. [2025-01-09 14:31:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32445 to 17451. [2025-01-09 14:31:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17451 states, 16397 states have (on average 1.5741904006830518) internal successors, (25812), 16439 states have internal predecessors, (25812), 955 states have call successors, (955), 98 states have call predecessors, (955), 98 states have return successors, (955), 913 states have call predecessors, (955), 955 states have call successors, (955) [2025-01-09 14:31:41,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17451 states to 17451 states and 27722 transitions. [2025-01-09 14:31:41,542 INFO L78 Accepts]: Start accepts. Automaton has 17451 states and 27722 transitions. Word has length 278 [2025-01-09 14:31:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:31:41,542 INFO L471 AbstractCegarLoop]: Abstraction has 17451 states and 27722 transitions. [2025-01-09 14:31:41,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-01-09 14:31:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 17451 states and 27722 transitions. [2025-01-09 14:31:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-09 14:31:41,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:31:41,552 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:31:41,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:31:41,552 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:31:41,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:31:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash -944978926, now seen corresponding path program 1 times [2025-01-09 14:31:41,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:31:41,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446291405] [2025-01-09 14:31:41,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:31:41,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:31:41,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes.