./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.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_floatingpointinfluence_no-floats_file-32.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 ec3847cd5673658302b62e6c9d30f5f024379aa30b6673222fdbc3270a2b4500 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:40:45,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:40:45,518 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:40:45,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:40:45,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:40:45,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:40:45,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:40:45,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:40:45,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:40:45,548 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:40:45,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:40:45,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:40:45,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:40:45,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:40:45,549 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:40:45,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:40:45,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:40:45,549 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:40:45,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:40:45,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:40:45,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:40:45,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:40:45,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:40:45,550 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:40:45,550 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:40:45,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:40:45,550 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:40:45,550 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:40:45,550 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:40:45,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:40:45,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:40:45,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:40:45,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:40:45,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:40:45,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:40:45,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:40:45,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:40:45,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:40:45,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:40:45,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:40:45,552 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:40:45,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:40:45,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:40:45,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:40:45,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:40:45,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:40:45,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:40:45,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:40:45,552 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 -> ec3847cd5673658302b62e6c9d30f5f024379aa30b6673222fdbc3270a2b4500 [2025-01-09 12:40:45,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:40:45,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:40:45,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:40:45,768 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:40:45,769 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:40:45,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i [2025-01-09 12:40:46,875 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5a8c8bc8/c14d716eeabc43049c25f7d6070c686a/FLAG7fc1702a1 [2025-01-09 12:40:47,144 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:40:47,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i [2025-01-09 12:40:47,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5a8c8bc8/c14d716eeabc43049c25f7d6070c686a/FLAG7fc1702a1 [2025-01-09 12:40:47,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5a8c8bc8/c14d716eeabc43049c25f7d6070c686a [2025-01-09 12:40:47,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:40:47,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:40:47,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:40:47,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:40:47,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:40:47,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:40:47" (1/1) ... [2025-01-09 12:40:47,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bea4536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47, skipping insertion in model container [2025-01-09 12:40:47,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:40:47" (1/1) ... [2025-01-09 12:40:47,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:40:47,563 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_floatingpointinfluence_no-floats_file-32.i[916,929] [2025-01-09 12:40:47,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:40:47,611 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:40:47,619 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_floatingpointinfluence_no-floats_file-32.i[916,929] [2025-01-09 12:40:47,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:40:47,656 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:40:47,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47 WrapperNode [2025-01-09 12:40:47,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:40:47,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:40:47,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:40:47,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:40:47,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47" (1/1) ... [2025-01-09 12:40:47,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47" (1/1) ... [2025-01-09 12:40:47,705 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-01-09 12:40:47,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:40:47,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:40:47,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:40:47,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:40:47,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47" (1/1) ... [2025-01-09 12:40:47,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47" (1/1) ... [2025-01-09 12:40:47,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47" (1/1) ... [2025-01-09 12:40:47,730 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 12:40:47,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47" (1/1) ... [2025-01-09 12:40:47,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47" (1/1) ... [2025-01-09 12:40:47,734 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47" (1/1) ... [2025-01-09 12:40:47,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47" (1/1) ... [2025-01-09 12:40:47,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47" (1/1) ... [2025-01-09 12:40:47,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47" (1/1) ... [2025-01-09 12:40:47,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47" (1/1) ... [2025-01-09 12:40:47,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:40:47,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:40:47,746 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:40:47,746 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:40:47,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47" (1/1) ... [2025-01-09 12:40:47,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:40:47,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:40:47,774 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 12:40:47,779 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 12:40:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:40:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:40:47,793 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:40:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:40:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:40:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:40:47,842 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:40:47,843 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:40:48,028 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 12:40:48,029 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:40:48,034 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:40:48,034 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:40:48,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:40:48 BoogieIcfgContainer [2025-01-09 12:40:48,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:40:48,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:40:48,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:40:48,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:40:48,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:40:47" (1/3) ... [2025-01-09 12:40:48,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d13c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:40:48, skipping insertion in model container [2025-01-09 12:40:48,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:40:47" (2/3) ... [2025-01-09 12:40:48,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d13c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:40:48, skipping insertion in model container [2025-01-09 12:40:48,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:40:48" (3/3) ... [2025-01-09 12:40:48,041 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-32.i [2025-01-09 12:40:48,050 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:40:48,050 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-32.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:40:48,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:40:48,087 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;@2907e2ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:40:48,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:40:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:40:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 12:40:48,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:40:48,096 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:48,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:40:48,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:40:48,099 INFO L85 PathProgramCache]: Analyzing trace with hash -99322565, now seen corresponding path program 1 times [2025-01-09 12:40:48,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:40:48,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186127126] [2025-01-09 12:40:48,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:40:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:40:48,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 12:40:48,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 12:40:48,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:40:48,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:40:48,280 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 12:40:48,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:40:48,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186127126] [2025-01-09 12:40:48,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186127126] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:40:48,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756067365] [2025-01-09 12:40:48,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:40:48,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:40:48,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:40:48,285 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 12:40:48,287 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 12:40:48,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 12:40:48,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 12:40:48,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:40:48,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:40:48,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:40:48,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:40:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 12:40:48,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:40:48,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756067365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:40:48,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:40:48,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:40:48,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217698236] [2025-01-09 12:40:48,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:40:48,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:40:48,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:40:48,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:40:48,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:40:48,447 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 12:40:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:40:48,494 INFO L93 Difference]: Finished difference Result 102 states and 173 transitions. [2025-01-09 12:40:48,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:40:48,495 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2025-01-09 12:40:48,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:40:48,500 INFO L225 Difference]: With dead ends: 102 [2025-01-09 12:40:48,500 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 12:40:48,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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 12:40:48,504 INFO L435 NwaCegarLoop]: 75 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, 75 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 12:40:48,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:40:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 12:40:48,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-09 12:40:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:40:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2025-01-09 12:40:48,542 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 113 [2025-01-09 12:40:48,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:40:48,543 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2025-01-09 12:40:48,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 12:40:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2025-01-09 12:40:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 12:40:48,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:40:48,545 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:48,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:40:48,745 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 12:40:48,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:40:48,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:40:48,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1192978043, now seen corresponding path program 1 times [2025-01-09 12:40:48,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:40:48,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827216396] [2025-01-09 12:40:48,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:40:48,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:40:48,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 12:40:48,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 12:40:48,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:40:48,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:40:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 12:40:52,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:40:52,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827216396] [2025-01-09 12:40:52,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827216396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:40:52,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:40:52,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:40:52,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299735851] [2025-01-09 12:40:52,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:40:52,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:40:52,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:40:52,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:40:52,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:40:52,024 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 12:40:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:40:53,172 INFO L93 Difference]: Finished difference Result 167 states and 243 transitions. [2025-01-09 12:40:53,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:40:53,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2025-01-09 12:40:53,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:40:53,174 INFO L225 Difference]: With dead ends: 167 [2025-01-09 12:40:53,174 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 12:40:53,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-01-09 12:40:53,175 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 206 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:40:53,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 397 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:40:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 12:40:53,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2025-01-09 12:40:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 12:40:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2025-01-09 12:40:53,199 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 113 [2025-01-09 12:40:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:40:53,199 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2025-01-09 12:40:53,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 12:40:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2025-01-09 12:40:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 12:40:53,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:40:53,200 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:53,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:40:53,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:40:53,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:40:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1107831537, now seen corresponding path program 1 times [2025-01-09 12:40:53,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:40:53,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763695185] [2025-01-09 12:40:53,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:40:53,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:40:53,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 12:40:53,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 12:40:53,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:40:53,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:40:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 12:40:54,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:40:54,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763695185] [2025-01-09 12:40:54,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763695185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:40:54,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:40:54,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:40:54,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607717686] [2025-01-09 12:40:54,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:40:54,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:40:54,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:40:54,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:40:54,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:40:54,668 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:40:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:40:55,102 INFO L93 Difference]: Finished difference Result 135 states and 189 transitions. [2025-01-09 12:40:55,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:40:55,103 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2025-01-09 12:40:55,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:40:55,104 INFO L225 Difference]: With dead ends: 135 [2025-01-09 12:40:55,104 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 12:40:55,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:40:55,105 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 87 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:40:55,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 372 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:40:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 12:40:55,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 107. [2025-01-09 12:40:55,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 12:40:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2025-01-09 12:40:55,114 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 114 [2025-01-09 12:40:55,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:40:55,114 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 157 transitions. [2025-01-09 12:40:55,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:40:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 157 transitions. [2025-01-09 12:40:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 12:40:55,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:40:55,115 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:55,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:40:55,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:40:55,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:40:55,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2077874488, now seen corresponding path program 1 times [2025-01-09 12:40:55,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:40:55,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149642554] [2025-01-09 12:40:55,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:40:55,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:40:55,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 12:40:55,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 12:40:55,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:40:55,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:40:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 12:40:56,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:40:56,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149642554] [2025-01-09 12:40:56,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149642554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:40:56,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:40:56,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:40:56,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536288988] [2025-01-09 12:40:56,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:40:56,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:40:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:40:56,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:40:56,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:40:56,896 INFO L87 Difference]: Start difference. First operand 107 states and 157 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:40:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:40:57,764 INFO L93 Difference]: Finished difference Result 174 states and 238 transitions. [2025-01-09 12:40:57,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 12:40:57,765 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2025-01-09 12:40:57,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:40:57,768 INFO L225 Difference]: With dead ends: 174 [2025-01-09 12:40:57,768 INFO L226 Difference]: Without dead ends: 172 [2025-01-09 12:40:57,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2025-01-09 12:40:57,769 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 171 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:40:57,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 456 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:40:57,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-09 12:40:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 113. [2025-01-09 12:40:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 74 states have internal predecessors, (95), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 12:40:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 167 transitions. [2025-01-09 12:40:57,795 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 167 transitions. Word has length 114 [2025-01-09 12:40:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:40:57,796 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 167 transitions. [2025-01-09 12:40:57,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:40:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 167 transitions. [2025-01-09 12:40:57,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 12:40:57,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:40:57,797 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:40:57,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:40:57,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:40:57,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:40:57,798 INFO L85 PathProgramCache]: Analyzing trace with hash -388527436, now seen corresponding path program 1 times [2025-01-09 12:40:57,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:40:57,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368832731] [2025-01-09 12:40:57,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:40:57,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:40:57,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 12:40:57,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 12:40:57,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:40:57,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:40:59,698 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 12:40:59,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:40:59,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368832731] [2025-01-09 12:40:59,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368832731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:40:59,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:40:59,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 12:40:59,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375720889] [2025-01-09 12:40:59,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:40:59,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:40:59,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:40:59,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:40:59,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:40:59,700 INFO L87 Difference]: Start difference. First operand 113 states and 167 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:41:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:01,221 INFO L93 Difference]: Finished difference Result 162 states and 221 transitions. [2025-01-09 12:41:01,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 12:41:01,222 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2025-01-09 12:41:01,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:01,223 INFO L225 Difference]: With dead ends: 162 [2025-01-09 12:41:01,223 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 12:41:01,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2025-01-09 12:41:01,224 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 142 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:41:01,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 444 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:41:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 12:41:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 113. [2025-01-09 12:41:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 74 states have internal predecessors, (95), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 12:41:01,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 167 transitions. [2025-01-09 12:41:01,245 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 167 transitions. Word has length 115 [2025-01-09 12:41:01,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:01,245 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 167 transitions. [2025-01-09 12:41:01,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:41:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 167 transitions. [2025-01-09 12:41:01,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 12:41:01,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:01,247 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:01,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:41:01,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:01,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:01,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1096417873, now seen corresponding path program 1 times [2025-01-09 12:41:01,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:01,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21028862] [2025-01-09 12:41:01,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:01,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:01,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 12:41:01,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 12:41:01,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:01,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 12:41:02,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:41:02,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21028862] [2025-01-09 12:41:02,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21028862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:41:02,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:41:02,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:41:02,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492435498] [2025-01-09 12:41:02,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:41:02,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:41:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:41:02,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:41:02,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:41:02,514 INFO L87 Difference]: Start difference. First operand 113 states and 167 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:41:03,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:03,654 INFO L93 Difference]: Finished difference Result 283 states and 398 transitions. [2025-01-09 12:41:03,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 12:41:03,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2025-01-09 12:41:03,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:03,656 INFO L225 Difference]: With dead ends: 283 [2025-01-09 12:41:03,657 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 12:41:03,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2025-01-09 12:41:03,660 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 131 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:41:03,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 449 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:41:03,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 12:41:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 118. [2025-01-09 12:41:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 12:41:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2025-01-09 12:41:03,676 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 115 [2025-01-09 12:41:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:03,677 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2025-01-09 12:41:03,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:41:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2025-01-09 12:41:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 12:41:03,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:03,679 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:03,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:41:03,679 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:03,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash -227930544, now seen corresponding path program 1 times [2025-01-09 12:41:03,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:03,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964543237] [2025-01-09 12:41:03,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:03,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:03,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 12:41:03,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 12:41:03,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:03,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 12:41:05,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:41:05,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964543237] [2025-01-09 12:41:05,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964543237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:41:05,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:41:05,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 12:41:05,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565787308] [2025-01-09 12:41:05,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:41:05,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:41:05,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:41:05,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:41:05,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:41:05,057 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:41:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:05,863 INFO L93 Difference]: Finished difference Result 177 states and 241 transitions. [2025-01-09 12:41:05,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 12:41:05,864 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2025-01-09 12:41:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:05,865 INFO L225 Difference]: With dead ends: 177 [2025-01-09 12:41:05,865 INFO L226 Difference]: Without dead ends: 175 [2025-01-09 12:41:05,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-01-09 12:41:05,866 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 160 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:41:05,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 547 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:41:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-09 12:41:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 120. [2025-01-09 12:41:05,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 81 states have (on average 1.308641975308642) internal successors, (106), 81 states have internal predecessors, (106), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 12:41:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2025-01-09 12:41:05,878 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 115 [2025-01-09 12:41:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:05,878 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2025-01-09 12:41:05,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:41:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2025-01-09 12:41:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 12:41:05,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:05,879 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:05,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:41:05,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:05,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash 602220516, now seen corresponding path program 1 times [2025-01-09 12:41:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:05,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671203357] [2025-01-09 12:41:05,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:05,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:05,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 12:41:05,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 12:41:05,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:05,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 12:41:06,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:41:06,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671203357] [2025-01-09 12:41:06,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671203357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:41:06,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:41:06,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:41:06,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939165220] [2025-01-09 12:41:06,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:41:06,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:41:06,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:41:06,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:41:06,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:41:06,785 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:41:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:07,388 INFO L93 Difference]: Finished difference Result 234 states and 330 transitions. [2025-01-09 12:41:07,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 12:41:07,388 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2025-01-09 12:41:07,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:07,389 INFO L225 Difference]: With dead ends: 234 [2025-01-09 12:41:07,389 INFO L226 Difference]: Without dead ends: 177 [2025-01-09 12:41:07,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2025-01-09 12:41:07,390 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 171 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:41:07,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 445 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:41:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-01-09 12:41:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 125. [2025-01-09 12:41:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 86 states have internal predecessors, (114), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 12:41:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 186 transitions. [2025-01-09 12:41:07,397 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 186 transitions. Word has length 116 [2025-01-09 12:41:07,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:07,398 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 186 transitions. [2025-01-09 12:41:07,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:41:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 186 transitions. [2025-01-09 12:41:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 12:41:07,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:07,399 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:07,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:41:07,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:07,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash -776272462, now seen corresponding path program 1 times [2025-01-09 12:41:07,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:07,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986469865] [2025-01-09 12:41:07,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:07,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:07,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 12:41:07,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 12:41:07,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:07,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:08,328 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 12:41:08,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:41:08,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986469865] [2025-01-09 12:41:08,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986469865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:41:08,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:41:08,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:41:08,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064009521] [2025-01-09 12:41:08,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:41:08,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:41:08,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:41:08,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:41:08,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:41:08,330 INFO L87 Difference]: Start difference. First operand 125 states and 186 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:41:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:09,663 INFO L93 Difference]: Finished difference Result 285 states and 384 transitions. [2025-01-09 12:41:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-09 12:41:09,664 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2025-01-09 12:41:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:09,671 INFO L225 Difference]: With dead ends: 285 [2025-01-09 12:41:09,672 INFO L226 Difference]: Without dead ends: 223 [2025-01-09 12:41:09,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=344, Invalid=1296, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 12:41:09,672 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 169 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:41:09,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 514 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:41:09,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-01-09 12:41:09,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 127. [2025-01-09 12:41:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 12:41:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2025-01-09 12:41:09,688 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 116 [2025-01-09 12:41:09,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:09,688 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2025-01-09 12:41:09,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:41:09,688 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2025-01-09 12:41:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 12:41:09,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:09,689 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:09,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:41:09,689 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:09,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:09,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1468873640, now seen corresponding path program 1 times [2025-01-09 12:41:09,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:09,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294501232] [2025-01-09 12:41:09,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:09,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:09,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 12:41:09,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 12:41:09,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:09,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 12:41:11,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:41:11,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294501232] [2025-01-09 12:41:11,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294501232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:41:11,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:41:11,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:41:11,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243851472] [2025-01-09 12:41:11,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:41:11,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:41:11,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:41:11,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:41:11,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:41:11,143 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:41:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:41:11,913 INFO L93 Difference]: Finished difference Result 165 states and 229 transitions. [2025-01-09 12:41:11,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 12:41:11,913 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2025-01-09 12:41:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:41:11,914 INFO L225 Difference]: With dead ends: 165 [2025-01-09 12:41:11,914 INFO L226 Difference]: Without dead ends: 163 [2025-01-09 12:41:11,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-01-09 12:41:11,915 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 78 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:41:11,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 393 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:41:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-09 12:41:11,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2025-01-09 12:41:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 12:41:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2025-01-09 12:41:11,921 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 117 [2025-01-09 12:41:11,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:41:11,921 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2025-01-09 12:41:11,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 12:41:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2025-01-09 12:41:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 12:41:11,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:41:11,923 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:41:11,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:41:11,926 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:41:11,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:41:11,927 INFO L85 PathProgramCache]: Analyzing trace with hash -681882294, now seen corresponding path program 1 times [2025-01-09 12:41:11,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:41:11,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556553384] [2025-01-09 12:41:11,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:11,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:41:11,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 12:41:11,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 12:41:11,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:11,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2025-01-09 12:41:13,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:41:13,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556553384] [2025-01-09 12:41:13,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556553384] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:41:13,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909523593] [2025-01-09 12:41:13,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:41:13,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:41:13,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:41:13,484 INFO L229 MonitoredProcess]: Starting monitored process 3 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 12:41:13,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:41:13,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 12:41:13,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 12:41:13,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:41:13,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:41:13,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 12:41:13,563 INFO L279 TraceCheckSpWp]: Computing forward predicates...