./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-44.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-44.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 16796499fc39343c4597b6d5b8afaf71194257ba1a30d074f591989e1c38b993 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:42:08,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:42:08,212 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:42:08,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:42:08,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:42:08,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:42:08,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:42:08,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:42:08,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:42:08,246 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:42:08,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:42:08,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:42:08,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:42:08,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:42:08,248 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:42:08,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:42:08,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:42:08,248 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:42:08,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:42:08,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:42:08,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:42:08,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:42:08,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:42:08,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:42:08,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:42:08,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:42:08,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:42:08,249 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:42:08,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:42:08,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:42:08,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:42:08,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:42:08,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:42:08,250 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:42:08,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:42:08,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:42:08,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:42:08,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:42:08,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:42:08,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:42:08,250 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:42:08,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:42:08,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:42:08,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:42:08,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:42:08,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:42:08,251 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:42:08,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:42:08,251 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 -> 16796499fc39343c4597b6d5b8afaf71194257ba1a30d074f591989e1c38b993 [2025-01-09 12:42:08,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:42:08,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:42:08,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:42:08,486 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:42:08,486 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:42:08,487 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-44.i [2025-01-09 12:42:09,620 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6cf5e919e/7bd9c8d015d64dddb1fcb751e4087c56/FLAGbaf164626 [2025-01-09 12:42:09,830 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:42:09,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-44.i [2025-01-09 12:42:09,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6cf5e919e/7bd9c8d015d64dddb1fcb751e4087c56/FLAGbaf164626 [2025-01-09 12:42:09,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6cf5e919e/7bd9c8d015d64dddb1fcb751e4087c56 [2025-01-09 12:42:09,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:42:09,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:42:09,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:42:09,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:42:09,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:42:09,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:42:09" (1/1) ... [2025-01-09 12:42:09,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c453938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:09, skipping insertion in model container [2025-01-09 12:42:09,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:42:09" (1/1) ... [2025-01-09 12:42:09,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:42:09,972 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-44.i[916,929] [2025-01-09 12:42:10,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:42:10,024 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:42:10,033 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-44.i[916,929] [2025-01-09 12:42:10,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:42:10,071 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:42:10,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:10 WrapperNode [2025-01-09 12:42:10,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:42:10,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:42:10,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:42:10,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:42:10,077 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:42:10" (1/1) ... [2025-01-09 12:42:10,083 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:42:10" (1/1) ... [2025-01-09 12:42:10,115 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-01-09 12:42:10,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:42:10,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:42:10,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:42:10,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:42:10,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:10" (1/1) ... [2025-01-09 12:42:10,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:10" (1/1) ... [2025-01-09 12:42:10,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:10" (1/1) ... [2025-01-09 12:42:10,145 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:42:10,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:10" (1/1) ... [2025-01-09 12:42:10,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:10" (1/1) ... [2025-01-09 12:42:10,152 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:10" (1/1) ... [2025-01-09 12:42:10,153 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:10" (1/1) ... [2025-01-09 12:42:10,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:10" (1/1) ... [2025-01-09 12:42:10,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:10" (1/1) ... [2025-01-09 12:42:10,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:10" (1/1) ... [2025-01-09 12:42:10,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:42:10,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:42:10,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:42:10,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:42:10,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:10" (1/1) ... [2025-01-09 12:42:10,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:42:10,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:42:10,191 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:42:10,195 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:42:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:42:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:42:10,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:42:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:42:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:42:10,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:42:10,257 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:42:10,259 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:42:10,436 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 12:42:10,436 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:42:10,445 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:42:10,445 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:42:10,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:42:10 BoogieIcfgContainer [2025-01-09 12:42:10,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:42:10,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:42:10,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:42:10,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:42:10,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:42:09" (1/3) ... [2025-01-09 12:42:10,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce6b43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:42:10, skipping insertion in model container [2025-01-09 12:42:10,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:42:10" (2/3) ... [2025-01-09 12:42:10,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce6b43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:42:10, skipping insertion in model container [2025-01-09 12:42:10,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:42:10" (3/3) ... [2025-01-09 12:42:10,452 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-44.i [2025-01-09 12:42:10,463 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:42:10,465 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-44.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:42:10,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:42:10,508 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;@7fe6213f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:42:10,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:42:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 12:42:10,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:42:10,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:10,519 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:10,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:10,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:10,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2048712167, now seen corresponding path program 1 times [2025-01-09 12:42:10,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:10,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295606310] [2025-01-09 12:42:10,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:10,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:42:10,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:42:10,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:10,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 12:42:10,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:10,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295606310] [2025-01-09 12:42:10,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295606310] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:42:10,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057101998] [2025-01-09 12:42:10,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:10,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:42:10,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:42:10,731 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:42:10,736 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:42:10,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:42:10,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:42:10,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:10,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:10,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:42:10,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:42:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 12:42:10,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:42:10,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057101998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:10,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:42:10,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:42:10,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485619436] [2025-01-09 12:42:10,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:10,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:42:10,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:10,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:42:10,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:42:10,912 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 12:42:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:10,930 INFO L93 Difference]: Finished difference Result 114 states and 198 transitions. [2025-01-09 12:42:10,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:42:10,932 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 140 [2025-01-09 12:42:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:10,936 INFO L225 Difference]: With dead ends: 114 [2025-01-09 12:42:10,936 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 12:42:10,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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:42:10,940 INFO L435 NwaCegarLoop]: 85 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, 85 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:42:10,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:42:10,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 12:42:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-09 12:42:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 12:42:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2025-01-09 12:42:10,974 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 140 [2025-01-09 12:42:10,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:10,975 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2025-01-09 12:42:10,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 12:42:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2025-01-09 12:42:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:42:10,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:10,977 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:10,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:42:11,182 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:42:11,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:11,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:11,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1545681573, now seen corresponding path program 1 times [2025-01-09 12:42:11,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:11,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886721621] [2025-01-09 12:42:11,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:11,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:11,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:42:11,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:42:11,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:11,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:42:15,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:15,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886721621] [2025-01-09 12:42:15,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886721621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:15,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:15,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:42:15,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044260210] [2025-01-09 12:42:15,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:15,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:42:15,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:15,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:42:15,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:42:15,277 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:15,974 INFO L93 Difference]: Finished difference Result 91 states and 126 transitions. [2025-01-09 12:42:15,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:42:15,975 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:42:15,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:15,977 INFO L225 Difference]: With dead ends: 91 [2025-01-09 12:42:15,978 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 12:42:15,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:42:15,979 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 52 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:15,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 394 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:42:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 12:42:15,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 64. [2025-01-09 12:42:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 12:42:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2025-01-09 12:42:15,994 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 140 [2025-01-09 12:42:15,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:15,995 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2025-01-09 12:42:15,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:15,996 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2025-01-09 12:42:15,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:42:15,997 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:15,998 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:15,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:42:15,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:15,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:16,000 INFO L85 PathProgramCache]: Analyzing trace with hash 229325789, now seen corresponding path program 1 times [2025-01-09 12:42:16,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:16,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376097243] [2025-01-09 12:42:16,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:16,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:16,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:42:16,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:42:16,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:16,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:42:16,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:16,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376097243] [2025-01-09 12:42:16,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376097243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:16,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:16,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:42:16,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633230459] [2025-01-09 12:42:16,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:16,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:42:16,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:16,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:42:16,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:42:16,110 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:16,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:16,129 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2025-01-09 12:42:16,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:42:16,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:42:16,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:16,131 INFO L225 Difference]: With dead ends: 181 [2025-01-09 12:42:16,131 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 12:42:16,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:42:16,132 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 40 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:16,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:42:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 12:42:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2025-01-09 12:42:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 69 states have internal predecessors, (85), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 12:42:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 177 transitions. [2025-01-09 12:42:16,147 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 177 transitions. Word has length 140 [2025-01-09 12:42:16,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:16,147 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 177 transitions. [2025-01-09 12:42:16,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 177 transitions. [2025-01-09 12:42:16,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 12:42:16,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:16,149 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:16,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:42:16,149 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:16,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:16,150 INFO L85 PathProgramCache]: Analyzing trace with hash 19411854, now seen corresponding path program 1 times [2025-01-09 12:42:16,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:16,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-01-09 12:42:16,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:16,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:16,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 12:42:16,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 12:42:16,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:16,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:18,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:42:18,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:18,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-01-09 12:42:18,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708350996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:18,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:18,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:42:18,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207176536] [2025-01-09 12:42:18,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:18,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:42:18,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:18,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:42:18,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:42:18,598 INFO L87 Difference]: Start difference. First operand 118 states and 177 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:19,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:19,359 INFO L93 Difference]: Finished difference Result 200 states and 278 transitions. [2025-01-09 12:42:19,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:42:19,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2025-01-09 12:42:19,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:19,361 INFO L225 Difference]: With dead ends: 200 [2025-01-09 12:42:19,361 INFO L226 Difference]: Without dead ends: 198 [2025-01-09 12:42:19,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:42:19,363 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 101 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:19,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 548 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:42:19,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-09 12:42:19,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 159. [2025-01-09 12:42:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 104 states have (on average 1.25) internal successors, (130), 106 states have internal predecessors, (130), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:42:19,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 230 transitions. [2025-01-09 12:42:19,386 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 230 transitions. Word has length 141 [2025-01-09 12:42:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:19,386 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 230 transitions. [2025-01-09 12:42:19,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 230 transitions. [2025-01-09 12:42:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 12:42:19,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:19,388 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:19,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:42:19,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:19,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:19,389 INFO L85 PathProgramCache]: Analyzing trace with hash 699470224, now seen corresponding path program 1 times [2025-01-09 12:42:19,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:19,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470142105] [2025-01-09 12:42:19,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:19,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:19,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 12:42:19,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 12:42:19,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:19,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:42:21,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:21,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470142105] [2025-01-09 12:42:21,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470142105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:21,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:21,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:42:21,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484234762] [2025-01-09 12:42:21,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:21,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:42:21,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:21,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:42:21,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:42:21,260 INFO L87 Difference]: Start difference. First operand 159 states and 230 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:21,930 INFO L93 Difference]: Finished difference Result 201 states and 281 transitions. [2025-01-09 12:42:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:42:21,930 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2025-01-09 12:42:21,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:21,933 INFO L225 Difference]: With dead ends: 201 [2025-01-09 12:42:21,934 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 12:42:21,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:42:21,934 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 85 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:21,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 500 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:42:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 12:42:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 155. [2025-01-09 12:42:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.24) internal successors, (124), 102 states have internal predecessors, (124), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:42:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 224 transitions. [2025-01-09 12:42:21,949 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 224 transitions. Word has length 141 [2025-01-09 12:42:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:21,950 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 224 transitions. [2025-01-09 12:42:21,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 224 transitions. [2025-01-09 12:42:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 12:42:21,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:21,951 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:21,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:42:21,951 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:21,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:21,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1054812159, now seen corresponding path program 1 times [2025-01-09 12:42:21,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:21,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233847462] [2025-01-09 12:42:21,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:21,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:21,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 12:42:21,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 12:42:21,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:21,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:42:21,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:21,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233847462] [2025-01-09 12:42:21,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233847462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:21,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:21,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:42:21,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282927808] [2025-01-09 12:42:21,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:21,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:42:21,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:21,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:42:21,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:42:21,999 INFO L87 Difference]: Start difference. First operand 155 states and 224 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:22,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:22,022 INFO L93 Difference]: Finished difference Result 309 states and 447 transitions. [2025-01-09 12:42:22,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:42:22,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2025-01-09 12:42:22,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:22,024 INFO L225 Difference]: With dead ends: 309 [2025-01-09 12:42:22,024 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 12:42:22,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:42:22,025 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:22,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 154 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:42:22,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 12:42:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2025-01-09 12:42:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.2) internal successors, (120), 102 states have internal predecessors, (120), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:42:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 220 transitions. [2025-01-09 12:42:22,041 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 220 transitions. Word has length 141 [2025-01-09 12:42:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:22,041 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 220 transitions. [2025-01-09 12:42:22,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 220 transitions. [2025-01-09 12:42:22,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 12:42:22,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:22,042 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:22,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:42:22,043 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:22,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:22,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1711292657, now seen corresponding path program 1 times [2025-01-09 12:42:22,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:22,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308736431] [2025-01-09 12:42:22,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:22,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:22,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 12:42:22,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 12:42:22,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:22,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:42:25,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:25,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308736431] [2025-01-09 12:42:25,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308736431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:25,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:25,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:42:25,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920296806] [2025-01-09 12:42:25,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:25,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:42:25,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:25,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:42:25,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:42:25,229 INFO L87 Difference]: Start difference. First operand 155 states and 220 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:26,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:26,744 INFO L93 Difference]: Finished difference Result 180 states and 245 transitions. [2025-01-09 12:42:26,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:42:26,745 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 142 [2025-01-09 12:42:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:26,746 INFO L225 Difference]: With dead ends: 180 [2025-01-09 12:42:26,746 INFO L226 Difference]: Without dead ends: 178 [2025-01-09 12:42:26,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:42:26,747 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 68 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:26,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 449 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:42:26,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-09 12:42:26,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2025-01-09 12:42:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:42:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 223 transitions. [2025-01-09 12:42:26,765 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 223 transitions. Word has length 142 [2025-01-09 12:42:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:26,765 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 223 transitions. [2025-01-09 12:42:26,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:26,766 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 223 transitions. [2025-01-09 12:42:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 12:42:26,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:26,768 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:26,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:42:26,768 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:26,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:26,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1713139699, now seen corresponding path program 1 times [2025-01-09 12:42:26,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:26,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392319114] [2025-01-09 12:42:26,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:26,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:26,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 12:42:26,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 12:42:26,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:26,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:42:33,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:33,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392319114] [2025-01-09 12:42:33,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392319114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:33,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:33,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:42:33,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45746308] [2025-01-09 12:42:33,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:33,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:42:33,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:33,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:42:33,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:42:33,464 INFO L87 Difference]: Start difference. First operand 157 states and 223 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:35,256 INFO L93 Difference]: Finished difference Result 173 states and 238 transitions. [2025-01-09 12:42:35,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 12:42:35,257 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 142 [2025-01-09 12:42:35,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:35,258 INFO L225 Difference]: With dead ends: 173 [2025-01-09 12:42:35,258 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 12:42:35,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:42:35,259 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 39 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:35,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 550 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:42:35,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 12:42:35,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2025-01-09 12:42:35,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:42:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 223 transitions. [2025-01-09 12:42:35,270 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 223 transitions. Word has length 142 [2025-01-09 12:42:35,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:35,271 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 223 transitions. [2025-01-09 12:42:35,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:35,271 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 223 transitions. [2025-01-09 12:42:35,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 12:42:35,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:35,272 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:35,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:42:35,272 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:35,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1903616269, now seen corresponding path program 1 times [2025-01-09 12:42:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:35,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871763202] [2025-01-09 12:42:35,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:35,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:35,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 12:42:35,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 12:42:35,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:35,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:42:37,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:37,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871763202] [2025-01-09 12:42:37,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871763202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:37,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:37,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:42:37,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420931571] [2025-01-09 12:42:37,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:37,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:42:37,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:37,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:42:37,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:42:37,939 INFO L87 Difference]: Start difference. First operand 157 states and 223 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:38,309 INFO L93 Difference]: Finished difference Result 189 states and 255 transitions. [2025-01-09 12:42:38,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:42:38,310 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 142 [2025-01-09 12:42:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:38,311 INFO L225 Difference]: With dead ends: 189 [2025-01-09 12:42:38,311 INFO L226 Difference]: Without dead ends: 187 [2025-01-09 12:42:38,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:42:38,312 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 47 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:38,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 366 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:42:38,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-09 12:42:38,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 160. [2025-01-09 12:42:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 105 states have (on average 1.2) internal successors, (126), 107 states have internal predecessors, (126), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:42:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 226 transitions. [2025-01-09 12:42:38,326 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 226 transitions. Word has length 142 [2025-01-09 12:42:38,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:38,326 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 226 transitions. [2025-01-09 12:42:38,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:38,326 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 226 transitions. [2025-01-09 12:42:38,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 12:42:38,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:38,328 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:38,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:42:38,328 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:38,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:38,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1901769227, now seen corresponding path program 1 times [2025-01-09 12:42:38,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:38,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313887334] [2025-01-09 12:42:38,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:38,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:38,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 12:42:38,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 12:42:38,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:38,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:42:45,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:45,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313887334] [2025-01-09 12:42:45,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313887334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:45,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:45,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:42:45,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090734080] [2025-01-09 12:42:45,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:45,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:42:45,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:45,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:42:45,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:42:45,082 INFO L87 Difference]: Start difference. First operand 160 states and 226 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:46,326 INFO L93 Difference]: Finished difference Result 176 states and 241 transitions. [2025-01-09 12:42:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 12:42:46,327 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 142 [2025-01-09 12:42:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:46,331 INFO L225 Difference]: With dead ends: 176 [2025-01-09 12:42:46,331 INFO L226 Difference]: Without dead ends: 174 [2025-01-09 12:42:46,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:42:46,332 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 32 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:46,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 435 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:42:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-01-09 12:42:46,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 155. [2025-01-09 12:42:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.19) internal successors, (119), 102 states have internal predecessors, (119), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:42:46,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 219 transitions. [2025-01-09 12:42:46,346 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 219 transitions. Word has length 142 [2025-01-09 12:42:46,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:46,346 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 219 transitions. [2025-01-09 12:42:46,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:46,346 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 219 transitions. [2025-01-09 12:42:46,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 12:42:46,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:46,347 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:46,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:42:46,348 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:46,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:46,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1767444892, now seen corresponding path program 1 times [2025-01-09 12:42:46,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:46,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874701796] [2025-01-09 12:42:46,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:46,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:46,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 12:42:46,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 12:42:46,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:46,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:42:49,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:49,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874701796] [2025-01-09 12:42:49,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874701796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:49,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:49,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:42:49,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068448077] [2025-01-09 12:42:49,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:49,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:42:49,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:49,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:42:49,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:42:49,313 INFO L87 Difference]: Start difference. First operand 155 states and 219 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:50,037 INFO L93 Difference]: Finished difference Result 211 states and 282 transitions. [2025-01-09 12:42:50,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 12:42:50,038 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 143 [2025-01-09 12:42:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:50,040 INFO L225 Difference]: With dead ends: 211 [2025-01-09 12:42:50,040 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 12:42:50,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2025-01-09 12:42:50,040 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 127 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:50,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 563 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:42:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 12:42:50,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 163. [2025-01-09 12:42:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 108 states have (on average 1.212962962962963) internal successors, (131), 110 states have internal predecessors, (131), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:42:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 231 transitions. [2025-01-09 12:42:50,053 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 231 transitions. Word has length 143 [2025-01-09 12:42:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:50,053 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 231 transitions. [2025-01-09 12:42:50,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 231 transitions. [2025-01-09 12:42:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 12:42:50,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:50,056 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:50,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:42:50,056 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:50,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:50,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1765597850, now seen corresponding path program 1 times [2025-01-09 12:42:50,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:50,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63283295] [2025-01-09 12:42:50,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:50,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:50,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 12:42:50,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 12:42:50,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:50,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:42:51,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:51,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63283295] [2025-01-09 12:42:51,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63283295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:51,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:51,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:42:51,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537715567] [2025-01-09 12:42:51,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:51,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:42:51,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:51,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:42:51,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:42:51,709 INFO L87 Difference]: Start difference. First operand 163 states and 231 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:52,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:52,285 INFO L93 Difference]: Finished difference Result 234 states and 309 transitions. [2025-01-09 12:42:52,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:42:52,286 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 143 [2025-01-09 12:42:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:52,287 INFO L225 Difference]: With dead ends: 234 [2025-01-09 12:42:52,287 INFO L226 Difference]: Without dead ends: 232 [2025-01-09 12:42:52,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2025-01-09 12:42:52,288 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 127 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:52,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 555 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:42:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-01-09 12:42:52,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 163. [2025-01-09 12:42:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 108 states have (on average 1.212962962962963) internal successors, (131), 110 states have internal predecessors, (131), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:42:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 231 transitions. [2025-01-09 12:42:52,301 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 231 transitions. Word has length 143 [2025-01-09 12:42:52,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:52,302 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 231 transitions. [2025-01-09 12:42:52,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:52,302 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 231 transitions. [2025-01-09 12:42:52,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 12:42:52,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:52,303 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:52,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:42:52,304 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:52,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:52,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1087386522, now seen corresponding path program 1 times [2025-01-09 12:42:52,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:52,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190211428] [2025-01-09 12:42:52,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:52,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:52,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 12:42:52,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 12:42:52,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:52,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:42:53,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:53,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190211428] [2025-01-09 12:42:53,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190211428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:53,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:53,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:42:53,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194206030] [2025-01-09 12:42:53,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:53,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:42:53,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:53,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:42:53,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:42:53,777 INFO L87 Difference]: Start difference. First operand 163 states and 231 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:54,225 INFO L93 Difference]: Finished difference Result 239 states and 315 transitions. [2025-01-09 12:42:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:42:54,225 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 143 [2025-01-09 12:42:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:54,227 INFO L225 Difference]: With dead ends: 239 [2025-01-09 12:42:54,227 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 12:42:54,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-01-09 12:42:54,227 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 71 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:54,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 597 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:42:54,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 12:42:54,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 174. [2025-01-09 12:42:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 119 states have (on average 1.218487394957983) internal successors, (145), 121 states have internal predecessors, (145), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:42:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 245 transitions. [2025-01-09 12:42:54,240 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 245 transitions. Word has length 143 [2025-01-09 12:42:54,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:54,240 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 245 transitions. [2025-01-09 12:42:54,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 245 transitions. [2025-01-09 12:42:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 12:42:54,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:54,241 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:54,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:42:54,241 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:54,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:54,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1085539480, now seen corresponding path program 1 times [2025-01-09 12:42:54,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:54,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479221764] [2025-01-09 12:42:54,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:54,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:54,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 12:42:54,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 12:42:54,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:54,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:42:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:42:55,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:42:55,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479221764] [2025-01-09 12:42:55,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479221764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:42:55,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:42:55,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:42:55,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487500757] [2025-01-09 12:42:55,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:42:55,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:42:55,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:42:55,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:42:55,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:42:55,374 INFO L87 Difference]: Start difference. First operand 174 states and 245 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:42:55,756 INFO L93 Difference]: Finished difference Result 222 states and 296 transitions. [2025-01-09 12:42:55,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 12:42:55,757 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 143 [2025-01-09 12:42:55,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:42:55,759 INFO L225 Difference]: With dead ends: 222 [2025-01-09 12:42:55,759 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 12:42:55,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-01-09 12:42:55,760 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 91 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:42:55,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 641 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:42:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 12:42:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 170. [2025-01-09 12:42:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 115 states have (on average 1.208695652173913) internal successors, (139), 117 states have internal predecessors, (139), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:42:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 239 transitions. [2025-01-09 12:42:55,773 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 239 transitions. Word has length 143 [2025-01-09 12:42:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:42:55,774 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 239 transitions. [2025-01-09 12:42:55,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:42:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 239 transitions. [2025-01-09 12:42:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 12:42:55,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:42:55,775 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:55,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 12:42:55,775 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:42:55,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:42:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1066380314, now seen corresponding path program 1 times [2025-01-09 12:42:55,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:42:55,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099758884] [2025-01-09 12:42:55,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:42:55,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:42:55,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 12:42:55,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 12:42:55,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:42:55,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:43:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:43:01,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:43:01,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099758884] [2025-01-09 12:43:01,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099758884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:43:01,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:43:01,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 12:43:01,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868902450] [2025-01-09 12:43:01,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:43:01,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:43:01,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:43:01,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:43:01,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:43:01,597 INFO L87 Difference]: Start difference. First operand 170 states and 239 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:43:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:43:04,107 INFO L93 Difference]: Finished difference Result 311 states and 436 transitions. [2025-01-09 12:43:04,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 12:43:04,107 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 143 [2025-01-09 12:43:04,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:43:04,109 INFO L225 Difference]: With dead ends: 311 [2025-01-09 12:43:04,109 INFO L226 Difference]: Without dead ends: 309 [2025-01-09 12:43:04,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-01-09 12:43:04,109 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 99 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:43:04,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 446 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 12:43:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-01-09 12:43:04,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 293. [2025-01-09 12:43:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 186 states have (on average 1.1989247311827957) internal successors, (223), 189 states have internal predecessors, (223), 98 states have call successors, (98), 8 states have call predecessors, (98), 8 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 12:43:04,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 419 transitions. [2025-01-09 12:43:04,136 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 419 transitions. Word has length 143 [2025-01-09 12:43:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:43:04,136 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 419 transitions. [2025-01-09 12:43:04,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:43:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 419 transitions. [2025-01-09 12:43:04,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 12:43:04,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:43:04,137 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:04,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 12:43:04,138 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:43:04,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:43:04,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1064533272, now seen corresponding path program 1 times [2025-01-09 12:43:04,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:43:04,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237988574] [2025-01-09 12:43:04,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:43:04,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:43:04,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 12:43:04,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 12:43:04,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:43:04,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:43:08,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:43:08,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:43:08,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237988574] [2025-01-09 12:43:08,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237988574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:43:08,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:43:08,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 12:43:08,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013999824] [2025-01-09 12:43:08,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:43:08,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:43:08,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:43:08,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:43:08,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:43:08,299 INFO L87 Difference]: Start difference. First operand 293 states and 419 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 12:43:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:43:10,732 INFO L93 Difference]: Finished difference Result 309 states and 434 transitions. [2025-01-09 12:43:10,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 12:43:10,732 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-01-09 12:43:10,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:43:10,734 INFO L225 Difference]: With dead ends: 309 [2025-01-09 12:43:10,734 INFO L226 Difference]: Without dead ends: 307 [2025-01-09 12:43:10,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2025-01-09 12:43:10,735 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 113 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:43:10,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 402 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:43:10,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-01-09 12:43:10,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 293. [2025-01-09 12:43:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 186 states have (on average 1.1989247311827957) internal successors, (223), 189 states have internal predecessors, (223), 98 states have call successors, (98), 8 states have call predecessors, (98), 8 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 12:43:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 419 transitions. [2025-01-09 12:43:10,757 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 419 transitions. Word has length 143 [2025-01-09 12:43:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:43:10,757 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 419 transitions. [2025-01-09 12:43:10,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 12:43:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 419 transitions. [2025-01-09 12:43:10,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 12:43:10,758 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:43:10,758 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:10,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 12:43:10,758 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:43:10,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:43:10,759 INFO L85 PathProgramCache]: Analyzing trace with hash -386321944, now seen corresponding path program 1 times [2025-01-09 12:43:10,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:43:10,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80668888] [2025-01-09 12:43:10,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:43:10,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:43:10,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 12:43:10,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 12:43:10,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:43:10,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:43:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:43:13,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:43:13,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80668888] [2025-01-09 12:43:13,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80668888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:43:13,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:43:13,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:43:13,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160581906] [2025-01-09 12:43:13,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:43:13,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:43:13,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:43:13,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:43:13,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:43:13,712 INFO L87 Difference]: Start difference. First operand 293 states and 419 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:43:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:43:17,447 INFO L93 Difference]: Finished difference Result 348 states and 478 transitions. [2025-01-09 12:43:17,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 12:43:17,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 143 [2025-01-09 12:43:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:43:17,450 INFO L225 Difference]: With dead ends: 348 [2025-01-09 12:43:17,450 INFO L226 Difference]: Without dead ends: 346 [2025-01-09 12:43:17,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:43:17,450 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 41 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:43:17,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 448 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:43:17,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-01-09 12:43:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 294. [2025-01-09 12:43:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 187 states have (on average 1.1925133689839573) internal successors, (223), 190 states have internal predecessors, (223), 98 states have call successors, (98), 8 states have call predecessors, (98), 8 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 12:43:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 419 transitions. [2025-01-09 12:43:17,474 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 419 transitions. Word has length 143 [2025-01-09 12:43:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:43:17,475 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 419 transitions. [2025-01-09 12:43:17,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:43:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 419 transitions. [2025-01-09 12:43:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 12:43:17,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:43:17,476 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:17,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 12:43:17,476 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:43:17,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:43:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash -384474902, now seen corresponding path program 1 times [2025-01-09 12:43:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:43:17,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484868199] [2025-01-09 12:43:17,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:43:17,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:43:17,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 12:43:17,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 12:43:17,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:43:17,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:43:20,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:43:20,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:43:20,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484868199] [2025-01-09 12:43:20,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484868199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:43:20,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:43:20,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:43:20,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896555207] [2025-01-09 12:43:20,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:43:20,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:43:20,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:43:20,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:43:20,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:43:20,974 INFO L87 Difference]: Start difference. First operand 294 states and 419 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:43:22,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:43:22,393 INFO L93 Difference]: Finished difference Result 296 states and 420 transitions. [2025-01-09 12:43:22,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:43:22,394 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 143 [2025-01-09 12:43:22,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:43:22,396 INFO L225 Difference]: With dead ends: 296 [2025-01-09 12:43:22,396 INFO L226 Difference]: Without dead ends: 294 [2025-01-09 12:43:22,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:43:22,397 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 38 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:43:22,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 409 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:43:22,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-01-09 12:43:22,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 284. [2025-01-09 12:43:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 177 states have (on average 1.1807909604519775) internal successors, (209), 180 states have internal predecessors, (209), 98 states have call successors, (98), 8 states have call predecessors, (98), 8 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 12:43:22,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 405 transitions. [2025-01-09 12:43:22,417 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 405 transitions. Word has length 143 [2025-01-09 12:43:22,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:43:22,418 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 405 transitions. [2025-01-09 12:43:22,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:43:22,418 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 405 transitions. [2025-01-09 12:43:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-01-09 12:43:22,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:43:22,420 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:43:22,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 12:43:22,420 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:43:22,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:43:22,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1545735966, now seen corresponding path program 1 times [2025-01-09 12:43:22,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:43:22,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833704440] [2025-01-09 12:43:22,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:43:22,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:43:22,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-09 12:43:22,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-09 12:43:22,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:43:22,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:43:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-01-09 12:43:23,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:43:23,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833704440] [2025-01-09 12:43:23,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833704440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:43:23,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196291223] [2025-01-09 12:43:23,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:43:23,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:43:23,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:43:23,455 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:43:23,455 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:43:23,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-09 12:43:23,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-09 12:43:23,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:43:23,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:43:23,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 12:43:23,546 INFO L279 TraceCheckSpWp]: Computing forward predicates...