./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.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_codestructure_dependencies_file-34.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 ef5fa028017d876074069fbbea93055df8f895424627b4673992e11de8e7d01a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:26:40,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:26:40,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 08:26:40,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:26:40,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:26:40,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:26:40,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:26:40,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:26:40,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:26:40,418 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:26:40,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:26:40,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:26:40,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:26:40,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:26:40,419 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:26:40,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:26:40,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:26:40,420 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:26:40,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:26:40,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:26:40,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:26:40,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:26:40,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:26:40,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:26:40,421 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:26:40,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:26:40,421 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:26:40,421 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:26:40,421 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:26:40,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:26:40,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:26:40,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:26:40,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:26:40,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:26:40,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:26:40,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:26:40,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:26:40,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:26:40,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:26:40,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:26:40,423 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:26:40,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:26:40,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:26:40,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:26:40,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:26:40,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:26:40,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:26:40,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:26:40,424 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 -> ef5fa028017d876074069fbbea93055df8f895424627b4673992e11de8e7d01a [2025-01-09 08:26:40,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:26:40,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:26:40,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:26:40,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:26:40,731 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:26:40,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i [2025-01-09 08:26:42,103 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5a3b8ef7/410add0919054b51a18af4ad74d07e04/FLAGcc94d56eb [2025-01-09 08:26:42,397 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:26:42,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i [2025-01-09 08:26:42,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5a3b8ef7/410add0919054b51a18af4ad74d07e04/FLAGcc94d56eb [2025-01-09 08:26:42,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5a3b8ef7/410add0919054b51a18af4ad74d07e04 [2025-01-09 08:26:42,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:26:42,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:26:42,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:26:42,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:26:42,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:26:42,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:26:42" (1/1) ... [2025-01-09 08:26:42,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aed9358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42, skipping insertion in model container [2025-01-09 08:26:42,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:26:42" (1/1) ... [2025-01-09 08:26:42,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:26:42,593 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_codestructure_dependencies_file-34.i[919,932] [2025-01-09 08:26:42,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:26:42,665 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:26:42,675 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_codestructure_dependencies_file-34.i[919,932] [2025-01-09 08:26:42,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:26:42,715 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:26:42,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42 WrapperNode [2025-01-09 08:26:42,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:26:42,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:26:42,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:26:42,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:26:42,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42" (1/1) ... [2025-01-09 08:26:42,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42" (1/1) ... [2025-01-09 08:26:42,764 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2025-01-09 08:26:42,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:26:42,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:26:42,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:26:42,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:26:42,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42" (1/1) ... [2025-01-09 08:26:42,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42" (1/1) ... [2025-01-09 08:26:42,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42" (1/1) ... [2025-01-09 08:26:42,800 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 08:26:42,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42" (1/1) ... [2025-01-09 08:26:42,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42" (1/1) ... [2025-01-09 08:26:42,811 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42" (1/1) ... [2025-01-09 08:26:42,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42" (1/1) ... [2025-01-09 08:26:42,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42" (1/1) ... [2025-01-09 08:26:42,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42" (1/1) ... [2025-01-09 08:26:42,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42" (1/1) ... [2025-01-09 08:26:42,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:26:42,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:26:42,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:26:42,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:26:42,827 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42" (1/1) ... [2025-01-09 08:26:42,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:26:42,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:26:42,856 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 08:26:42,864 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 08:26:42,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:26:42,883 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:26:42,883 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:26:42,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:26:42,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:26:42,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:26:42,955 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:26:42,957 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:26:43,352 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 08:26:43,354 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:26:43,366 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:26:43,368 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:26:43,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:26:43 BoogieIcfgContainer [2025-01-09 08:26:43,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:26:43,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:26:43,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:26:43,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:26:43,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:26:42" (1/3) ... [2025-01-09 08:26:43,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a0f2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:26:43, skipping insertion in model container [2025-01-09 08:26:43,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:26:42" (2/3) ... [2025-01-09 08:26:43,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a0f2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:26:43, skipping insertion in model container [2025-01-09 08:26:43,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:26:43" (3/3) ... [2025-01-09 08:26:43,379 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-34.i [2025-01-09 08:26:43,393 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:26:43,395 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-34.i that has 2 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:26:43,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:26:43,479 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;@1fd3bcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:26:43,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:26:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 08:26:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 08:26:43,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:26:43,495 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:26:43,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:26:43,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:26:43,501 INFO L85 PathProgramCache]: Analyzing trace with hash -418256497, now seen corresponding path program 1 times [2025-01-09 08:26:43,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:26:43,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553448416] [2025-01-09 08:26:43,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:26:43,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:26:43,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 08:26:43,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 08:26:43,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:26:43,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:26:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 08:26:44,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:26:44,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553448416] [2025-01-09 08:26:44,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553448416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:26:44,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:26:44,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:26:44,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203406508] [2025-01-09 08:26:44,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:26:44,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:26:44,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:26:44,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:26:44,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:26:44,278 INFO L87 Difference]: Start difference. First operand has 68 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 08:26:44,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:26:44,464 INFO L93 Difference]: Finished difference Result 220 states and 373 transitions. [2025-01-09 08:26:44,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:26:44,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2025-01-09 08:26:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:26:44,474 INFO L225 Difference]: With dead ends: 220 [2025-01-09 08:26:44,474 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 08:26:44,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:26:44,481 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 125 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:26:44,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 313 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:26:44,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 08:26:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 127. [2025-01-09 08:26:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 98 states have internal predecessors, (143), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 08:26:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 195 transitions. [2025-01-09 08:26:44,533 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 195 transitions. Word has length 92 [2025-01-09 08:26:44,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:26:44,535 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 195 transitions. [2025-01-09 08:26:44,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 08:26:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 195 transitions. [2025-01-09 08:26:44,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 08:26:44,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:26:44,541 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:26:44,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:26:44,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:26:44,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:26:44,543 INFO L85 PathProgramCache]: Analyzing trace with hash -857116438, now seen corresponding path program 1 times [2025-01-09 08:26:44,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:26:44,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21386397] [2025-01-09 08:26:44,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:26:44,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:26:44,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 08:26:44,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 08:26:44,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:26:44,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:26:44,822 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 08:26:44,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:26:44,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21386397] [2025-01-09 08:26:44,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21386397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:26:44,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:26:44,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:26:44,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434028770] [2025-01-09 08:26:44,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:26:44,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:26:44,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:26:44,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:26:44,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:26:44,826 INFO L87 Difference]: Start difference. First operand 127 states and 195 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 08:26:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:26:45,063 INFO L93 Difference]: Finished difference Result 406 states and 619 transitions. [2025-01-09 08:26:45,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:26:45,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2025-01-09 08:26:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:26:45,066 INFO L225 Difference]: With dead ends: 406 [2025-01-09 08:26:45,066 INFO L226 Difference]: Without dead ends: 282 [2025-01-09 08:26:45,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:26:45,073 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 159 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:26:45,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 246 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:26:45,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-09 08:26:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 129. [2025-01-09 08:26:45,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 100 states have (on average 1.43) internal successors, (143), 100 states have internal predecessors, (143), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 08:26:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions. [2025-01-09 08:26:45,115 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 93 [2025-01-09 08:26:45,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:26:45,116 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 195 transitions. [2025-01-09 08:26:45,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 08:26:45,116 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions. [2025-01-09 08:26:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 08:26:45,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:26:45,118 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:26:45,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:26:45,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:26:45,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:26:45,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1952268774, now seen corresponding path program 1 times [2025-01-09 08:26:45,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:26:45,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380267617] [2025-01-09 08:26:45,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:26:45,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:26:45,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 08:26:45,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 08:26:45,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:26:45,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:26:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 08:26:49,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:26:49,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380267617] [2025-01-09 08:26:49,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380267617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:26:49,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:26:49,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:26:49,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304865365] [2025-01-09 08:26:49,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:26:49,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:26:49,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:26:49,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:26:49,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:26:49,151 INFO L87 Difference]: Start difference. First operand 129 states and 195 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 08:26:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:26:50,963 INFO L93 Difference]: Finished difference Result 384 states and 568 transitions. [2025-01-09 08:26:50,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 08:26:50,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2025-01-09 08:26:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:26:50,966 INFO L225 Difference]: With dead ends: 384 [2025-01-09 08:26:50,967 INFO L226 Difference]: Without dead ends: 258 [2025-01-09 08:26:50,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:26:50,968 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 267 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:26:50,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 353 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 08:26:50,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-09 08:26:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 165. [2025-01-09 08:26:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 129 states have (on average 1.4108527131782946) internal successors, (182), 130 states have internal predecessors, (182), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 08:26:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2025-01-09 08:26:50,988 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 94 [2025-01-09 08:26:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:26:50,989 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2025-01-09 08:26:50,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 08:26:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2025-01-09 08:26:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 08:26:50,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:26:50,991 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:26:50,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:26:50,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:26:50,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:26:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2084533084, now seen corresponding path program 1 times [2025-01-09 08:26:50,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:26:50,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171084157] [2025-01-09 08:26:50,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:26:50,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:26:51,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 08:26:51,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 08:26:51,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:26:51,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:26:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 08:26:51,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:26:51,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171084157] [2025-01-09 08:26:51,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171084157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:26:51,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:26:51,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:26:51,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576043576] [2025-01-09 08:26:51,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:26:51,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:26:51,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:26:51,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:26:51,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:26:51,341 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 08:26:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:26:51,563 INFO L93 Difference]: Finished difference Result 402 states and 593 transitions. [2025-01-09 08:26:51,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:26:51,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2025-01-09 08:26:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:26:51,567 INFO L225 Difference]: With dead ends: 402 [2025-01-09 08:26:51,567 INFO L226 Difference]: Without dead ends: 248 [2025-01-09 08:26:51,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:26:51,568 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 78 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:26:51,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 220 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:26:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-01-09 08:26:51,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 198. [2025-01-09 08:26:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 153 states have (on average 1.3986928104575163) internal successors, (214), 153 states have internal predecessors, (214), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 08:26:51,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 292 transitions. [2025-01-09 08:26:51,608 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 292 transitions. Word has length 94 [2025-01-09 08:26:51,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:26:51,609 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 292 transitions. [2025-01-09 08:26:51,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 08:26:51,609 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 292 transitions. [2025-01-09 08:26:51,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 08:26:51,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:26:51,614 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:26:51,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:26:51,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:26:51,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:26:51,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1423757636, now seen corresponding path program 1 times [2025-01-09 08:26:51,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:26:51,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092811880] [2025-01-09 08:26:51,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:26:51,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:26:51,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 08:26:51,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 08:26:51,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:26:51,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:27:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 08:27:28,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:27:28,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092811880] [2025-01-09 08:27:28,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092811880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:27:28,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:27:28,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 08:27:28,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803811353] [2025-01-09 08:27:28,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:27:28,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 08:27:28,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:27:28,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 08:27:28,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:27:28,620 INFO L87 Difference]: Start difference. First operand 198 states and 292 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 08:27:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:27:29,698 INFO L93 Difference]: Finished difference Result 333 states and 477 transitions. [2025-01-09 08:27:29,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 08:27:29,699 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2025-01-09 08:27:29,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:27:29,701 INFO L225 Difference]: With dead ends: 333 [2025-01-09 08:27:29,701 INFO L226 Difference]: Without dead ends: 331 [2025-01-09 08:27:29,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2025-01-09 08:27:29,704 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 480 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:27:29,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 614 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 08:27:29,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-01-09 08:27:29,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 217. [2025-01-09 08:27:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 172 states have (on average 1.4011627906976745) internal successors, (241), 172 states have internal predecessors, (241), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 08:27:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 319 transitions. [2025-01-09 08:27:29,732 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 319 transitions. Word has length 97 [2025-01-09 08:27:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:27:29,733 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 319 transitions. [2025-01-09 08:27:29,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 08:27:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 319 transitions. [2025-01-09 08:27:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 08:27:29,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:27:29,736 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:27:29,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:27:29,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:27:29,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:27:29,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1385483226, now seen corresponding path program 1 times [2025-01-09 08:27:29,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:27:29,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204996859] [2025-01-09 08:27:29,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:27:29,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:27:29,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 08:27:29,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 08:27:29,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:27:29,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:27:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 08:27:30,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:27:30,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204996859] [2025-01-09 08:27:30,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204996859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:27:30,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:27:30,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:27:30,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396434329] [2025-01-09 08:27:30,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:27:30,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:27:30,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:27:30,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:27:30,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:27:30,811 INFO L87 Difference]: Start difference. First operand 217 states and 319 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 08:27:31,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:27:31,076 INFO L93 Difference]: Finished difference Result 421 states and 618 transitions. [2025-01-09 08:27:31,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:27:31,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2025-01-09 08:27:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:27:31,079 INFO L225 Difference]: With dead ends: 421 [2025-01-09 08:27:31,079 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 08:27:31,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:27:31,080 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 116 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:27:31,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 255 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:27:31,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 08:27:31,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 223. [2025-01-09 08:27:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 178 states have (on average 1.398876404494382) internal successors, (249), 178 states have internal predecessors, (249), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 08:27:31,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2025-01-09 08:27:31,105 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 97 [2025-01-09 08:27:31,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:27:31,106 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2025-01-09 08:27:31,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 08:27:31,106 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2025-01-09 08:27:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 08:27:31,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:27:31,107 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:27:31,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:27:31,108 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:27:31,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:27:31,108 INFO L85 PathProgramCache]: Analyzing trace with hash 877064954, now seen corresponding path program 1 times [2025-01-09 08:27:31,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:27:31,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038877901] [2025-01-09 08:27:31,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:27:31,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:27:31,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 08:27:31,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 08:27:31,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:27:31,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 08:28:02,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:28:02,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038877901] [2025-01-09 08:28:02,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038877901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:28:02,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:28:02,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 08:28:02,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627754561] [2025-01-09 08:28:02,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:28:02,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 08:28:02,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:28:02,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 08:28:02,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:28:02,344 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 08:28:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:28:03,215 INFO L93 Difference]: Finished difference Result 353 states and 502 transitions. [2025-01-09 08:28:03,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 08:28:03,216 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2025-01-09 08:28:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:28:03,219 INFO L225 Difference]: With dead ends: 353 [2025-01-09 08:28:03,219 INFO L226 Difference]: Without dead ends: 351 [2025-01-09 08:28:03,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-01-09 08:28:03,221 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 250 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:28:03,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 651 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:28:03,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-01-09 08:28:03,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 241. [2025-01-09 08:28:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 196 states have (on average 1.3928571428571428) internal successors, (273), 196 states have internal predecessors, (273), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 08:28:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 351 transitions. [2025-01-09 08:28:03,250 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 351 transitions. Word has length 97 [2025-01-09 08:28:03,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:28:03,250 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 351 transitions. [2025-01-09 08:28:03,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 08:28:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 351 transitions. [2025-01-09 08:28:03,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 08:28:03,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:28:03,252 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:28:03,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:28:03,252 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:28:03,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:28:03,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1182265918, now seen corresponding path program 1 times [2025-01-09 08:28:03,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:28:03,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746343220] [2025-01-09 08:28:03,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:03,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:28:03,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 08:28:03,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 08:28:03,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:03,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:28:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 08:28:03,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:28:03,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746343220] [2025-01-09 08:28:03,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746343220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:28:03,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:28:03,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:28:03,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291290860] [2025-01-09 08:28:03,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:28:03,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:28:03,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:28:03,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:28:03,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:28:03,398 INFO L87 Difference]: Start difference. First operand 241 states and 351 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 08:28:03,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:28:03,536 INFO L93 Difference]: Finished difference Result 453 states and 659 transitions. [2025-01-09 08:28:03,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:28:03,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2025-01-09 08:28:03,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:28:03,539 INFO L225 Difference]: With dead ends: 453 [2025-01-09 08:28:03,539 INFO L226 Difference]: Without dead ends: 286 [2025-01-09 08:28:03,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:28:03,540 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 92 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:28:03,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 431 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:28:03,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-01-09 08:28:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 242. [2025-01-09 08:28:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 197 states have (on average 1.3908629441624365) internal successors, (274), 197 states have internal predecessors, (274), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 08:28:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 352 transitions. [2025-01-09 08:28:03,567 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 352 transitions. Word has length 97 [2025-01-09 08:28:03,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:28:03,567 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 352 transitions. [2025-01-09 08:28:03,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 08:28:03,568 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 352 transitions. [2025-01-09 08:28:03,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 08:28:03,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:28:03,569 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:28:03,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:28:03,570 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:28:03,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:28:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1088139683, now seen corresponding path program 1 times [2025-01-09 08:28:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:28:03,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859109866] [2025-01-09 08:28:03,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:28:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:28:03,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 08:28:03,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 08:28:03,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:28:03,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat