./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.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_normal_file-81.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 4ec23d859d65533fc787a9c2fed70b8c69daa3b1ed2a3fca10d530d490a26e0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:47:19,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:47:19,150 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:47:19,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:47:19,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:47:19,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:47:19,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:47:19,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:47:19,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:47:19,189 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:47:19,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:47:19,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:47:19,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:47:19,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:47:19,189 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:47:19,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:47:19,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:47:19,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:47:19,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:47:19,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:47:19,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:47:19,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:47:19,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:47:19,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:47:19,192 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:47:19,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:47:19,192 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:47:19,192 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:47:19,192 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:47:19,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:47:19,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:47:19,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:47:19,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:47:19,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:47:19,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:47:19,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:47:19,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:47:19,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:47:19,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:47:19,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:47:19,193 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:47:19,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:47:19,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:47:19,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:47:19,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:47:19,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:47:19,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:47:19,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:47:19,193 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 -> 4ec23d859d65533fc787a9c2fed70b8c69daa3b1ed2a3fca10d530d490a26e0e [2025-01-09 08:47:19,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:47:19,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:47:19,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:47:19,432 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:47:19,432 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:47:19,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i [2025-01-09 08:47:20,714 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65a54fd96/426f2fb167b34469acf6f108994a1c82/FLAG5617cab0d [2025-01-09 08:47:20,991 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:47:20,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i [2025-01-09 08:47:21,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65a54fd96/426f2fb167b34469acf6f108994a1c82/FLAG5617cab0d [2025-01-09 08:47:21,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65a54fd96/426f2fb167b34469acf6f108994a1c82 [2025-01-09 08:47:21,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:47:21,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:47:21,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:47:21,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:47:21,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:47:21,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:47:21" (1/1) ... [2025-01-09 08:47:21,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba96874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:47:21, skipping insertion in model container [2025-01-09 08:47:21,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:47:21" (1/1) ... [2025-01-09 08:47:21,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:47:21,438 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_normal_file-81.i[913,926] [2025-01-09 08:47:21,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:47:21,517 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:47:21,525 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_normal_file-81.i[913,926] [2025-01-09 08:47:21,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:47:21,584 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:47:21,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:47:21 WrapperNode [2025-01-09 08:47:21,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:47:21,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:47:21,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:47:21,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:47:21,595 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:47:21" (1/1) ... [2025-01-09 08:47:21,602 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:47:21" (1/1) ... [2025-01-09 08:47:21,622 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2025-01-09 08:47:21,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:47:21,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:47:21,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:47:21,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:47:21,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:47:21" (1/1) ... [2025-01-09 08:47:21,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:47:21" (1/1) ... [2025-01-09 08:47:21,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:47:21" (1/1) ... [2025-01-09 08:47:21,654 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:47:21,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:47:21" (1/1) ... [2025-01-09 08:47:21,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:47:21" (1/1) ... [2025-01-09 08:47:21,660 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:47:21" (1/1) ... [2025-01-09 08:47:21,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:47:21" (1/1) ... [2025-01-09 08:47:21,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:47:21" (1/1) ... [2025-01-09 08:47:21,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:47:21" (1/1) ... [2025-01-09 08:47:21,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:47:21" (1/1) ... [2025-01-09 08:47:21,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:47:21,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:47:21,670 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:47:21,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:47:21,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:47:21" (1/1) ... [2025-01-09 08:47:21,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:47:21,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:47:21,700 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:47:21,702 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:47:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:47:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:47:21,719 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:47:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:47:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:47:21,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:47:21,781 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:47:21,783 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:47:22,088 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 08:47:22,088 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:47:22,101 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:47:22,101 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:47:22,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:47:22 BoogieIcfgContainer [2025-01-09 08:47:22,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:47:22,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:47:22,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:47:22,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:47:22,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:47:21" (1/3) ... [2025-01-09 08:47:22,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297d701f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:47:22, skipping insertion in model container [2025-01-09 08:47:22,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:47:21" (2/3) ... [2025-01-09 08:47:22,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297d701f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:47:22, skipping insertion in model container [2025-01-09 08:47:22,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:47:22" (3/3) ... [2025-01-09 08:47:22,115 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-81.i [2025-01-09 08:47:22,128 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:47:22,129 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-81.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:47:22,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:47:22,189 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;@5edbee3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:47:22,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:47:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 08:47:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 08:47:22,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:47:22,209 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:22,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:47:22,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:47:22,215 INFO L85 PathProgramCache]: Analyzing trace with hash -584762598, now seen corresponding path program 1 times [2025-01-09 08:47:22,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:47:22,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629667288] [2025-01-09 08:47:22,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:47:22,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:47:22,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 08:47:22,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 08:47:22,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:47:22,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:47:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-01-09 08:47:22,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:47:22,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629667288] [2025-01-09 08:47:22,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629667288] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:47:22,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605952715] [2025-01-09 08:47:22,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:47:22,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:47:22,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:47:22,500 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 08:47:22,502 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 08:47:22,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 08:47:22,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 08:47:22,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:47:22,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:47:22,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:47:22,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:47:22,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-01-09 08:47:22,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:47:22,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605952715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:47:22,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:47:22,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:47:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682327284] [2025-01-09 08:47:22,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:47:22,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:47:22,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:47:22,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:47:22,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:47:22,738 INFO L87 Difference]: Start difference. First operand has 85 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 08:47:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:47:22,771 INFO L93 Difference]: Finished difference Result 164 states and 289 transitions. [2025-01-09 08:47:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:47:22,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2025-01-09 08:47:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:47:22,777 INFO L225 Difference]: With dead ends: 164 [2025-01-09 08:47:22,778 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 08:47:22,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 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 08:47:22,782 INFO L435 NwaCegarLoop]: 126 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, 126 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 08:47:22,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:47:22,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 08:47:22,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 08:47:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 08:47:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2025-01-09 08:47:22,813 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 196 [2025-01-09 08:47:22,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:47:22,814 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2025-01-09 08:47:22,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 08:47:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2025-01-09 08:47:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 08:47:22,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:47:22,817 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:22,825 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 08:47:23,022 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 08:47:23,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:47:23,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:47:23,023 INFO L85 PathProgramCache]: Analyzing trace with hash -429720806, now seen corresponding path program 1 times [2025-01-09 08:47:23,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:47:23,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019285229] [2025-01-09 08:47:23,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:47:23,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:47:23,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 08:47:23,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 08:47:23,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:47:23,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:47:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 08:47:23,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:47:23,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019285229] [2025-01-09 08:47:23,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019285229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:47:23,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:47:23,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:47:23,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223057422] [2025-01-09 08:47:23,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:47:23,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:47:23,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:47:23,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:47:23,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:47:23,646 INFO L87 Difference]: Start difference. First operand 82 states and 126 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:47:23,845 INFO L93 Difference]: Finished difference Result 241 states and 374 transitions. [2025-01-09 08:47:23,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:47:23,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 196 [2025-01-09 08:47:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:47:23,851 INFO L225 Difference]: With dead ends: 241 [2025-01-09 08:47:23,853 INFO L226 Difference]: Without dead ends: 162 [2025-01-09 08:47:23,854 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 08:47:23,854 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 66 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:47:23,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 297 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:47:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-01-09 08:47:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2025-01-09 08:47:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 93 states have internal predecessors, (121), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 08:47:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 249 transitions. [2025-01-09 08:47:23,881 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 249 transitions. Word has length 196 [2025-01-09 08:47:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:47:23,881 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 249 transitions. [2025-01-09 08:47:23,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 249 transitions. [2025-01-09 08:47:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 08:47:23,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:47:23,884 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:23,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:47:23,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:47:23,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:47:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash 850142872, now seen corresponding path program 1 times [2025-01-09 08:47:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:47:23,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467800404] [2025-01-09 08:47:23,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:47:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:47:23,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 08:47:23,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 08:47:23,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:47:23,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:47:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 08:47:34,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:47:34,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467800404] [2025-01-09 08:47:34,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467800404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:47:34,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:47:34,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 08:47:34,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546911668] [2025-01-09 08:47:34,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:47:34,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:47:34,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:47:34,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:47:34,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:47:34,349 INFO L87 Difference]: Start difference. First operand 160 states and 249 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:47:34,895 INFO L93 Difference]: Finished difference Result 348 states and 523 transitions. [2025-01-09 08:47:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 08:47:34,898 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 196 [2025-01-09 08:47:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:47:34,901 INFO L225 Difference]: With dead ends: 348 [2025-01-09 08:47:34,901 INFO L226 Difference]: Without dead ends: 269 [2025-01-09 08:47:34,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:47:34,903 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 257 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:47:34,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 408 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:47:34,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-01-09 08:47:34,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 219. [2025-01-09 08:47:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 138 states have (on average 1.3333333333333333) internal successors, (184), 140 states have internal predecessors, (184), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 08:47:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 336 transitions. [2025-01-09 08:47:34,944 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 336 transitions. Word has length 196 [2025-01-09 08:47:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:47:34,944 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 336 transitions. [2025-01-09 08:47:34,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 336 transitions. [2025-01-09 08:47:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 08:47:34,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:47:34,946 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:34,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:47:34,947 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:47:34,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:47:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash -429932977, now seen corresponding path program 1 times [2025-01-09 08:47:34,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:47:34,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110036482] [2025-01-09 08:47:34,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:47:34,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:47:34,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 08:47:34,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 08:47:34,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:47:34,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:47:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 08:47:35,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:47:35,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110036482] [2025-01-09 08:47:35,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110036482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:47:35,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:47:35,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:47:35,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969585244] [2025-01-09 08:47:35,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:47:35,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:47:35,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:47:35,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:47:35,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:47:35,037 INFO L87 Difference]: Start difference. First operand 219 states and 336 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:47:35,080 INFO L93 Difference]: Finished difference Result 547 states and 834 transitions. [2025-01-09 08:47:35,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:47:35,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-01-09 08:47:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:47:35,085 INFO L225 Difference]: With dead ends: 547 [2025-01-09 08:47:35,085 INFO L226 Difference]: Without dead ends: 345 [2025-01-09 08:47:35,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:47:35,087 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 53 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:47:35,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 265 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:47:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-01-09 08:47:35,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2025-01-09 08:47:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 231 states have (on average 1.329004329004329) internal successors, (307), 236 states have internal predecessors, (307), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 08:47:35,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 511 transitions. [2025-01-09 08:47:35,136 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 511 transitions. Word has length 197 [2025-01-09 08:47:35,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:47:35,137 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 511 transitions. [2025-01-09 08:47:35,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 511 transitions. [2025-01-09 08:47:35,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 08:47:35,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:47:35,139 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:35,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:47:35,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:47:35,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:47:35,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1239279603, now seen corresponding path program 1 times [2025-01-09 08:47:35,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:47:35,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485747441] [2025-01-09 08:47:35,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:47:35,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:47:35,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 08:47:35,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 08:47:35,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:47:35,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:47:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 08:47:39,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:47:39,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485747441] [2025-01-09 08:47:39,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485747441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:47:39,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:47:39,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:47:39,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769040152] [2025-01-09 08:47:39,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:47:39,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:47:39,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:47:39,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:47:39,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:47:39,209 INFO L87 Difference]: Start difference. First operand 341 states and 511 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:47:39,631 INFO L93 Difference]: Finished difference Result 732 states and 1091 transitions. [2025-01-09 08:47:39,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:47:39,632 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-01-09 08:47:39,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:47:39,635 INFO L225 Difference]: With dead ends: 732 [2025-01-09 08:47:39,635 INFO L226 Difference]: Without dead ends: 408 [2025-01-09 08:47:39,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:47:39,636 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 100 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:47:39,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 367 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:47:39,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-01-09 08:47:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 369. [2025-01-09 08:47:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 259 states have (on average 1.3397683397683398) internal successors, (347), 264 states have internal predecessors, (347), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 08:47:39,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 551 transitions. [2025-01-09 08:47:39,666 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 551 transitions. Word has length 197 [2025-01-09 08:47:39,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:47:39,667 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 551 transitions. [2025-01-09 08:47:39,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:39,667 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 551 transitions. [2025-01-09 08:47:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 08:47:39,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:47:39,669 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:39,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:47:39,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:47:39,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:47:39,669 INFO L85 PathProgramCache]: Analyzing trace with hash 392346739, now seen corresponding path program 1 times [2025-01-09 08:47:39,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:47:39,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539839101] [2025-01-09 08:47:39,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:47:39,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:47:39,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 08:47:39,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 08:47:39,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:47:39,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:47:39,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 08:47:39,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:47:39,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539839101] [2025-01-09 08:47:39,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539839101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:47:39,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:47:39,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:47:39,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034722243] [2025-01-09 08:47:39,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:47:39,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:47:39,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:47:39,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:47:39,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:47:39,728 INFO L87 Difference]: Start difference. First operand 369 states and 551 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:39,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:47:39,768 INFO L93 Difference]: Finished difference Result 734 states and 1092 transitions. [2025-01-09 08:47:39,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:47:39,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-01-09 08:47:39,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:47:39,771 INFO L225 Difference]: With dead ends: 734 [2025-01-09 08:47:39,771 INFO L226 Difference]: Without dead ends: 382 [2025-01-09 08:47:39,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:47:39,772 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 59 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:47:39,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 255 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:47:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-01-09 08:47:39,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 288. [2025-01-09 08:47:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 205 states have (on average 1.351219512195122) internal successors, (277), 207 states have internal predecessors, (277), 76 states have call successors, (76), 6 states have call predecessors, (76), 6 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 08:47:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 429 transitions. [2025-01-09 08:47:39,794 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 429 transitions. Word has length 197 [2025-01-09 08:47:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:47:39,795 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 429 transitions. [2025-01-09 08:47:39,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 429 transitions. [2025-01-09 08:47:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 08:47:39,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:47:39,796 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:39,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:47:39,797 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:47:39,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:47:39,797 INFO L85 PathProgramCache]: Analyzing trace with hash 650512177, now seen corresponding path program 1 times [2025-01-09 08:47:39,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:47:39,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950049322] [2025-01-09 08:47:39,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:47:39,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:47:39,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 08:47:39,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 08:47:39,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:47:39,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:47:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 08:47:43,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:47:43,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950049322] [2025-01-09 08:47:43,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950049322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:47:43,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:47:43,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:47:43,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866976386] [2025-01-09 08:47:43,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:47:43,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:47:43,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:47:43,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:47:43,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:47:43,903 INFO L87 Difference]: Start difference. First operand 288 states and 429 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:47:44,337 INFO L93 Difference]: Finished difference Result 619 states and 917 transitions. [2025-01-09 08:47:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:47:44,339 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-01-09 08:47:44,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:47:44,343 INFO L225 Difference]: With dead ends: 619 [2025-01-09 08:47:44,343 INFO L226 Difference]: Without dead ends: 348 [2025-01-09 08:47:44,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:47:44,345 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 78 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:47:44,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 541 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:47:44,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-01-09 08:47:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 307. [2025-01-09 08:47:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 224 states have (on average 1.3660714285714286) internal successors, (306), 226 states have internal predecessors, (306), 76 states have call successors, (76), 6 states have call predecessors, (76), 6 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 08:47:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 458 transitions. [2025-01-09 08:47:44,378 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 458 transitions. Word has length 197 [2025-01-09 08:47:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:47:44,379 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 458 transitions. [2025-01-09 08:47:44,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 458 transitions. [2025-01-09 08:47:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 08:47:44,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:47:44,381 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:44,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:47:44,381 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:47:44,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:47:44,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1833473708, now seen corresponding path program 1 times [2025-01-09 08:47:44,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:47:44,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359836541] [2025-01-09 08:47:44,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:47:44,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:47:44,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 08:47:44,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 08:47:44,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:47:44,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:47:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 08:47:48,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:47:48,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359836541] [2025-01-09 08:47:48,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359836541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:47:48,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:47:48,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:47:48,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66203123] [2025-01-09 08:47:48,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:47:48,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:47:48,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:47:48,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:47:48,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:47:48,214 INFO L87 Difference]: Start difference. First operand 307 states and 458 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:47:49,590 INFO L93 Difference]: Finished difference Result 682 states and 998 transitions. [2025-01-09 08:47:49,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 08:47:49,591 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-01-09 08:47:49,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:47:49,593 INFO L225 Difference]: With dead ends: 682 [2025-01-09 08:47:49,594 INFO L226 Difference]: Without dead ends: 392 [2025-01-09 08:47:49,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-01-09 08:47:49,598 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 184 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:47:49,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 524 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:47:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-01-09 08:47:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 284. [2025-01-09 08:47:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 201 states have (on average 1.3432835820895523) internal successors, (270), 203 states have internal predecessors, (270), 76 states have call successors, (76), 6 states have call predecessors, (76), 6 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 08:47:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 422 transitions. [2025-01-09 08:47:49,631 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 422 transitions. Word has length 198 [2025-01-09 08:47:49,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:47:49,632 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 422 transitions. [2025-01-09 08:47:49,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 422 transitions. [2025-01-09 08:47:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 08:47:49,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:47:49,634 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:49,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:47:49,635 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:47:49,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:47:49,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1610933096, now seen corresponding path program 1 times [2025-01-09 08:47:49,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:47:49,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522027049] [2025-01-09 08:47:49,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:47:49,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:47:49,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 08:47:49,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 08:47:49,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:47:49,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:47:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 08:47:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:47:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522027049] [2025-01-09 08:47:50,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522027049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:47:50,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:47:50,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:47:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878564275] [2025-01-09 08:47:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:47:50,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:47:50,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:47:50,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:47:50,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:47:50,987 INFO L87 Difference]: Start difference. First operand 284 states and 422 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:47:51,997 INFO L93 Difference]: Finished difference Result 629 states and 914 transitions. [2025-01-09 08:47:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 08:47:51,997 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-01-09 08:47:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:47:51,999 INFO L225 Difference]: With dead ends: 629 [2025-01-09 08:47:51,999 INFO L226 Difference]: Without dead ends: 362 [2025-01-09 08:47:52,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-01-09 08:47:52,000 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 290 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:47:52,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 430 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 08:47:52,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-01-09 08:47:52,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 284. [2025-01-09 08:47:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 201 states have (on average 1.3432835820895523) internal successors, (270), 203 states have internal predecessors, (270), 76 states have call successors, (76), 6 states have call predecessors, (76), 6 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 08:47:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 422 transitions. [2025-01-09 08:47:52,052 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 422 transitions. Word has length 198 [2025-01-09 08:47:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:47:52,055 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 422 transitions. [2025-01-09 08:47:52,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:47:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 422 transitions. [2025-01-09 08:47:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 08:47:52,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:47:52,057 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:52,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 08:47:52,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:47:52,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:47:52,058 INFO L85 PathProgramCache]: Analyzing trace with hash -909868518, now seen corresponding path program 1 times [2025-01-09 08:47:52,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:47:52,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213595582] [2025-01-09 08:47:52,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:47:52,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:47:52,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 08:47:52,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 08:47:52,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:47:52,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:47:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 08:47:53,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:47:53,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213595582] [2025-01-09 08:47:53,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213595582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:47:53,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:47:53,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 08:47:53,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713262399] [2025-01-09 08:47:53,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:47:53,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:47:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:47:53,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:47:53,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:47:53,558 INFO L87 Difference]: Start difference. First operand 284 states and 422 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 08:47:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:47:54,830 INFO L93 Difference]: Finished difference Result 677 states and 977 transitions. [2025-01-09 08:47:54,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 08:47:54,831 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 198 [2025-01-09 08:47:54,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:47:54,834 INFO L225 Difference]: With dead ends: 677 [2025-01-09 08:47:54,834 INFO L226 Difference]: Without dead ends: 410 [2025-01-09 08:47:54,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2025-01-09 08:47:54,835 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 335 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 08:47:54,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 587 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 08:47:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-01-09 08:47:54,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 285. [2025-01-09 08:47:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 202 states have (on average 1.3465346534653466) internal successors, (272), 204 states have internal predecessors, (272), 76 states have call successors, (76), 6 states have call predecessors, (76), 6 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 08:47:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 424 transitions. [2025-01-09 08:47:54,863 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 424 transitions. Word has length 198 [2025-01-09 08:47:54,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:47:54,863 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 424 transitions. [2025-01-09 08:47:54,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 08:47:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 424 transitions. [2025-01-09 08:47:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 08:47:54,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:47:54,865 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:54,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 08:47:54,866 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:47:54,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:47:54,866 INFO L85 PathProgramCache]: Analyzing trace with hash 101248732, now seen corresponding path program 1 times [2025-01-09 08:47:54,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:47:54,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294730154] [2025-01-09 08:47:54,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:47:54,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:47:54,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 08:47:54,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 08:47:54,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:47:54,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:47:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 08:47:56,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:47:56,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294730154] [2025-01-09 08:47:56,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294730154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:47:56,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:47:56,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 08:47:56,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007232034] [2025-01-09 08:47:56,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:47:56,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:47:56,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:47:56,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:47:56,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:47:56,556 INFO L87 Difference]: Start difference. First operand 285 states and 424 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 08:47:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:47:57,548 INFO L93 Difference]: Finished difference Result 695 states and 1002 transitions. [2025-01-09 08:47:57,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 08:47:57,549 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 198 [2025-01-09 08:47:57,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:47:57,552 INFO L225 Difference]: With dead ends: 695 [2025-01-09 08:47:57,552 INFO L226 Difference]: Without dead ends: 427 [2025-01-09 08:47:57,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2025-01-09 08:47:57,554 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 327 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:47:57,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 635 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 08:47:57,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-01-09 08:47:57,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 273. [2025-01-09 08:47:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 190 states have (on average 1.3368421052631578) internal successors, (254), 192 states have internal predecessors, (254), 76 states have call successors, (76), 6 states have call predecessors, (76), 6 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 08:47:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 406 transitions. [2025-01-09 08:47:57,583 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 406 transitions. Word has length 198 [2025-01-09 08:47:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:47:57,583 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 406 transitions. [2025-01-09 08:47:57,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 08:47:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 406 transitions. [2025-01-09 08:47:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 08:47:57,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:47:57,584 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:57,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 08:47:57,586 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:47:57,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:47:57,586 INFO L85 PathProgramCache]: Analyzing trace with hash 109362099, now seen corresponding path program 1 times [2025-01-09 08:47:57,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:47:57,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549143782] [2025-01-09 08:47:57,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:47:57,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:47:57,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 08:47:57,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 08:47:57,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:47:57,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:48:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 08:48:17,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:48:17,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549143782] [2025-01-09 08:48:17,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549143782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:48:17,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:48:17,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:48:17,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412889141] [2025-01-09 08:48:17,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:48:17,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:48:17,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:48:17,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:48:17,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:48:17,053 INFO L87 Difference]: Start difference. First operand 273 states and 406 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:48:18,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:48:18,208 INFO L93 Difference]: Finished difference Result 382 states and 555 transitions. [2025-01-09 08:48:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:48:18,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-01-09 08:48:18,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:48:18,212 INFO L225 Difference]: With dead ends: 382 [2025-01-09 08:48:18,212 INFO L226 Difference]: Without dead ends: 380 [2025-01-09 08:48:18,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:48:18,212 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 117 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:48:18,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1140 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:48:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-01-09 08:48:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2025-01-09 08:48:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 258 states have (on average 1.2945736434108528) internal successors, (334), 262 states have internal predecessors, (334), 108 states have call successors, (108), 10 states have call predecessors, (108), 10 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 08:48:18,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 550 transitions. [2025-01-09 08:48:18,262 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 550 transitions. Word has length 198 [2025-01-09 08:48:18,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:48:18,263 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 550 transitions. [2025-01-09 08:48:18,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:48:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 550 transitions. [2025-01-09 08:48:18,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 08:48:18,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:48:18,265 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:18,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 08:48:18,265 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:48:18,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:48:18,266 INFO L85 PathProgramCache]: Analyzing trace with hash -22585194, now seen corresponding path program 1 times [2025-01-09 08:48:18,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:48:18,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333312016] [2025-01-09 08:48:18,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:18,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:48:18,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 08:48:18,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 08:48:18,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:18,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:48:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 08:48:18,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:48:18,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333312016] [2025-01-09 08:48:18,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333312016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:48:18,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:48:18,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:48:18,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025655883] [2025-01-09 08:48:18,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:48:18,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:48:18,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:48:18,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:48:18,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:48:18,424 INFO L87 Difference]: Start difference. First operand 377 states and 550 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:48:18,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:48:18,597 INFO L93 Difference]: Finished difference Result 715 states and 1022 transitions. [2025-01-09 08:48:18,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:48:18,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-01-09 08:48:18,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:48:18,601 INFO L225 Difference]: With dead ends: 715 [2025-01-09 08:48:18,601 INFO L226 Difference]: Without dead ends: 449 [2025-01-09 08:48:18,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:48:18,602 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 130 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:48:18,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 393 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:48:18,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-01-09 08:48:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 438. [2025-01-09 08:48:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 295 states have (on average 1.2508474576271187) internal successors, (369), 301 states have internal predecessors, (369), 128 states have call successors, (128), 14 states have call predecessors, (128), 14 states have return successors, (128), 122 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 08:48:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 625 transitions. [2025-01-09 08:48:18,664 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 625 transitions. Word has length 198 [2025-01-09 08:48:18,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:48:18,665 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 625 transitions. [2025-01-09 08:48:18,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 08:48:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 625 transitions. [2025-01-09 08:48:18,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 08:48:18,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:48:18,666 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:18,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 08:48:18,667 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:48:18,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:48:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2075909144, now seen corresponding path program 1 times [2025-01-09 08:48:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:48:18,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294250482] [2025-01-09 08:48:18,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:48:18,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:48:18,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 08:48:18,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 08:48:18,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:48:18,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat