./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-52.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_fillercode_fillercodestructure_filler-ps-co_file-52.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 d2756a3afeabee0bd07615570da162530b76933ca347aab7efd24527f8af5fb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:06:50,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:06:50,445 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:06:50,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:06:50,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:06:50,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:06:50,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:06:50,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:06:50,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:06:50,486 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:06:50,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:06:50,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:06:50,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:06:50,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:06:50,487 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:06:50,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:06:50,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:06:50,488 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:06:50,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:06:50,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:06:50,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:06:50,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:06:50,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:06:50,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:06:50,489 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:06:50,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:06:50,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:06:50,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:06:50,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:06:50,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:06:50,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:06:50,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:06:50,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:06:50,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:06:50,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:06:50,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:06:50,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:06:50,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:06:50,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:06:50,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:06:50,490 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:06:50,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:06:50,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:06:50,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:06:50,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:06:50,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:06:50,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:06:50,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:06:50,491 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 -> d2756a3afeabee0bd07615570da162530b76933ca347aab7efd24527f8af5fb3 [2025-01-09 12:06:50,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:06:50,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:06:50,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:06:50,733 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:06:50,734 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:06:50,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-52.i [2025-01-09 12:06:51,813 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99444ca06/c5cbc7927aca476b827c8ae182b6f2c6/FLAG83d95ada8 [2025-01-09 12:06:52,018 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:06:52,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-52.i [2025-01-09 12:06:52,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99444ca06/c5cbc7927aca476b827c8ae182b6f2c6/FLAG83d95ada8 [2025-01-09 12:06:52,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99444ca06/c5cbc7927aca476b827c8ae182b6f2c6 [2025-01-09 12:06:52,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:06:52,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:06:52,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:06:52,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:06:52,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:06:52,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:06:52" (1/1) ... [2025-01-09 12:06:52,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284431ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:52, skipping insertion in model container [2025-01-09 12:06:52,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:06:52" (1/1) ... [2025-01-09 12:06:52,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:06:52,522 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_fillercode_fillercodestructure_filler-ps-co_file-52.i[919,932] [2025-01-09 12:06:52,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:06:52,594 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:06:52,601 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_fillercode_fillercodestructure_filler-ps-co_file-52.i[919,932] [2025-01-09 12:06:52,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:06:52,653 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:06:52,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:52 WrapperNode [2025-01-09 12:06:52,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:06:52,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:06:52,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:06:52,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:06:52,661 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:06:52" (1/1) ... [2025-01-09 12:06:52,669 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:06:52" (1/1) ... [2025-01-09 12:06:52,693 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2025-01-09 12:06:52,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:06:52,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:06:52,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:06:52,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:06:52,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:52" (1/1) ... [2025-01-09 12:06:52,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:52" (1/1) ... [2025-01-09 12:06:52,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:52" (1/1) ... [2025-01-09 12:06:52,711 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:06:52,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:52" (1/1) ... [2025-01-09 12:06:52,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:52" (1/1) ... [2025-01-09 12:06:52,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:52" (1/1) ... [2025-01-09 12:06:52,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:52" (1/1) ... [2025-01-09 12:06:52,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:52" (1/1) ... [2025-01-09 12:06:52,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:52" (1/1) ... [2025-01-09 12:06:52,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:52" (1/1) ... [2025-01-09 12:06:52,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:06:52,735 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:06:52,735 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:06:52,735 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:06:52,736 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:52" (1/1) ... [2025-01-09 12:06:52,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:06:52,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:06:52,757 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:06:52,760 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:06:52,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:06:52,774 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:06:52,774 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:06:52,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:06:52,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:06:52,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:06:52,837 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:06:52,838 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:06:53,099 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 12:06:53,099 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:06:53,109 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:06:53,109 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:06:53,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:06:53 BoogieIcfgContainer [2025-01-09 12:06:53,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:06:53,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:06:53,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:06:53,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:06:53,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:06:52" (1/3) ... [2025-01-09 12:06:53,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7b8f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:06:53, skipping insertion in model container [2025-01-09 12:06:53,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:52" (2/3) ... [2025-01-09 12:06:53,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7b8f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:06:53, skipping insertion in model container [2025-01-09 12:06:53,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:06:53" (3/3) ... [2025-01-09 12:06:53,123 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-52.i [2025-01-09 12:06:53,134 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:06:53,135 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-52.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:06:53,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:06:53,193 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;@a82f833, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:06:53,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:06:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 12:06:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 12:06:53,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:06:53,206 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:53,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:06:53,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:06:53,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1080598804, now seen corresponding path program 1 times [2025-01-09 12:06:53,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:06:53,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145074040] [2025-01-09 12:06:53,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:06:53,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:06:53,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 12:06:53,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 12:06:53,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:06:53,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:06:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 12:06:53,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:06:53,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145074040] [2025-01-09 12:06:53,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145074040] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:06:53,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915154183] [2025-01-09 12:06:53,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:06:53,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:06:53,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:06:53,487 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:06:53,488 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:06:53,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 12:06:53,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 12:06:53,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:06:53,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:06:53,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:06:53,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:06:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 12:06:53,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:06:53,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915154183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:06:53,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:06:53,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:06:53,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653183908] [2025-01-09 12:06:53,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:06:53,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:06:53,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:06:53,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:06:53,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:06:53,662 INFO L87 Difference]: Start difference. First operand has 87 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 12:06:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:06:53,678 INFO L93 Difference]: Finished difference Result 168 states and 285 transitions. [2025-01-09 12:06:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:06:53,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 153 [2025-01-09 12:06:53,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:06:53,683 INFO L225 Difference]: With dead ends: 168 [2025-01-09 12:06:53,683 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 12:06:53,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 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:06:53,687 INFO L435 NwaCegarLoop]: 129 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, 129 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:06:53,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:06:53,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 12:06:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 12:06:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 12:06:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2025-01-09 12:06:53,713 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 153 [2025-01-09 12:06:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:06:53,714 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2025-01-09 12:06:53,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 12:06:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2025-01-09 12:06:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 12:06:53,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:06:53,716 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:53,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:06:53,920 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:06:53,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:06:53,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:06:53,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1234756828, now seen corresponding path program 1 times [2025-01-09 12:06:53,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:06:53,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64448240] [2025-01-09 12:06:53,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:06:53,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:06:53,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 12:06:53,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 12:06:53,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:06:53,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:06:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:06:54,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:06:54,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64448240] [2025-01-09 12:06:54,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64448240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:06:54,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:06:54,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:06:54,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524211373] [2025-01-09 12:06:54,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:06:54,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:06:54,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:06:54,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:06:54,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:06:54,200 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:06:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:06:54,250 INFO L93 Difference]: Finished difference Result 246 states and 381 transitions. [2025-01-09 12:06:54,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:06:54,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2025-01-09 12:06:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:06:54,255 INFO L225 Difference]: With dead ends: 246 [2025-01-09 12:06:54,256 INFO L226 Difference]: Without dead ends: 165 [2025-01-09 12:06:54,256 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:06:54,256 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 82 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:06:54,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 265 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:06:54,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-01-09 12:06:54,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2025-01-09 12:06:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 115 states have (on average 1.4173913043478261) internal successors, (163), 115 states have internal predecessors, (163), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 12:06:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 251 transitions. [2025-01-09 12:06:54,275 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 251 transitions. Word has length 153 [2025-01-09 12:06:54,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:06:54,275 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 251 transitions. [2025-01-09 12:06:54,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:06:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 251 transitions. [2025-01-09 12:06:54,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 12:06:54,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:06:54,277 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:54,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:06:54,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:06:54,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:06:54,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2057121711, now seen corresponding path program 1 times [2025-01-09 12:06:54,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:06:54,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93318763] [2025-01-09 12:06:54,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:06:54,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:06:54,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 12:06:54,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 12:06:54,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:06:54,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:06:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:06:54,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:06:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93318763] [2025-01-09 12:06:54,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93318763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:06:54,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:06:54,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:06:54,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196441468] [2025-01-09 12:06:54,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:06:54,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:06:54,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:06:54,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:06:54,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:06:54,574 INFO L87 Difference]: Start difference. First operand 162 states and 251 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:06:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:06:54,639 INFO L93 Difference]: Finished difference Result 480 states and 747 transitions. [2025-01-09 12:06:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:06:54,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2025-01-09 12:06:54,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:06:54,644 INFO L225 Difference]: With dead ends: 480 [2025-01-09 12:06:54,644 INFO L226 Difference]: Without dead ends: 321 [2025-01-09 12:06:54,647 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:06:54,647 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 87 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:06:54,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 241 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:06:54,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-01-09 12:06:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2025-01-09 12:06:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 226 states have (on average 1.415929203539823) internal successors, (320), 226 states have internal predecessors, (320), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 12:06:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 496 transitions. [2025-01-09 12:06:54,699 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 496 transitions. Word has length 154 [2025-01-09 12:06:54,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:06:54,699 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 496 transitions. [2025-01-09 12:06:54,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:06:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 496 transitions. [2025-01-09 12:06:54,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 12:06:54,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:06:54,703 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:54,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:06:54,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:06:54,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:06:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash -622231316, now seen corresponding path program 1 times [2025-01-09 12:06:54,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:06:54,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757198401] [2025-01-09 12:06:54,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:06:54,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:06:54,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 12:06:54,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 12:06:54,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:06:54,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:06:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:06:55,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:06:55,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757198401] [2025-01-09 12:06:55,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757198401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:06:55,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:06:55,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:06:55,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602907185] [2025-01-09 12:06:55,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:06:55,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:06:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:06:55,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:06:55,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:06:55,193 INFO L87 Difference]: Start difference. First operand 319 states and 496 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:06:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:06:55,296 INFO L93 Difference]: Finished difference Result 697 states and 1085 transitions. [2025-01-09 12:06:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:06:55,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2025-01-09 12:06:55,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:06:55,300 INFO L225 Difference]: With dead ends: 697 [2025-01-09 12:06:55,301 INFO L226 Difference]: Without dead ends: 381 [2025-01-09 12:06:55,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:06:55,303 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 49 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:06:55,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 213 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:06:55,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-01-09 12:06:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 371. [2025-01-09 12:06:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 255 states have (on average 1.384313725490196) internal successors, (353), 255 states have internal predecessors, (353), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-01-09 12:06:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 573 transitions. [2025-01-09 12:06:55,354 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 573 transitions. Word has length 155 [2025-01-09 12:06:55,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:06:55,355 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 573 transitions. [2025-01-09 12:06:55,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:06:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 573 transitions. [2025-01-09 12:06:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 12:06:55,358 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:06:55,358 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:55,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:06:55,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:06:55,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:06:55,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1705387410, now seen corresponding path program 1 times [2025-01-09 12:06:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:06:55,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820623573] [2025-01-09 12:06:55,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:06:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:06:55,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 12:06:55,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 12:06:55,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:06:55,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:06:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:06:55,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:06:55,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820623573] [2025-01-09 12:06:55,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820623573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:06:55,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:06:55,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:06:55,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193401552] [2025-01-09 12:06:55,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:06:55,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:06:55,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:06:55,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:06:55,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:06:55,458 INFO L87 Difference]: Start difference. First operand 371 states and 573 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:06:55,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:06:55,523 INFO L93 Difference]: Finished difference Result 719 states and 1122 transitions. [2025-01-09 12:06:55,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:06:55,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2025-01-09 12:06:55,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:06:55,527 INFO L225 Difference]: With dead ends: 719 [2025-01-09 12:06:55,527 INFO L226 Difference]: Without dead ends: 403 [2025-01-09 12:06:55,529 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:06:55,530 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 11 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:06:55,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 239 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:06:55,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-01-09 12:06:55,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 379. [2025-01-09 12:06:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 263 states have (on average 1.3878326996197718) internal successors, (365), 263 states have internal predecessors, (365), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-01-09 12:06:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 585 transitions. [2025-01-09 12:06:55,566 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 585 transitions. Word has length 156 [2025-01-09 12:06:55,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:06:55,566 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 585 transitions. [2025-01-09 12:06:55,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:06:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 585 transitions. [2025-01-09 12:06:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 12:06:55,568 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:06:55,568 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:55,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:06:55,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:06:55,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:06:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1293582362, now seen corresponding path program 1 times [2025-01-09 12:06:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:06:55,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742606960] [2025-01-09 12:06:55,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:06:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:06:55,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 12:06:55,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 12:06:55,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:06:55,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:06:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:06:55,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:06:55,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742606960] [2025-01-09 12:06:55,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742606960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:06:55,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:06:55,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:06:55,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893418113] [2025-01-09 12:06:55,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:06:55,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:06:55,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:06:55,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:06:55,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:06:55,687 INFO L87 Difference]: Start difference. First operand 379 states and 585 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:06:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:06:55,756 INFO L93 Difference]: Finished difference Result 713 states and 1107 transitions. [2025-01-09 12:06:55,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:06:55,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2025-01-09 12:06:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:06:55,758 INFO L225 Difference]: With dead ends: 713 [2025-01-09 12:06:55,758 INFO L226 Difference]: Without dead ends: 389 [2025-01-09 12:06:55,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:06:55,759 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 47 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:06:55,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 230 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:06:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-01-09 12:06:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 380. [2025-01-09 12:06:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 264 states have (on average 1.3863636363636365) internal successors, (366), 264 states have internal predecessors, (366), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-01-09 12:06:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 586 transitions. [2025-01-09 12:06:55,795 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 586 transitions. Word has length 157 [2025-01-09 12:06:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:06:55,796 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 586 transitions. [2025-01-09 12:06:55,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:06:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 586 transitions. [2025-01-09 12:06:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 12:06:55,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:06:55,797 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:55,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:06:55,797 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:06:55,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:06:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash -379348791, now seen corresponding path program 1 times [2025-01-09 12:06:55,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:06:55,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686977768] [2025-01-09 12:06:55,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:06:55,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:06:55,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 12:06:55,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 12:06:55,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:06:55,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:07:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:07:01,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:07:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686977768] [2025-01-09 12:07:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686977768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:07:01,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:07:01,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 12:07:01,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206664924] [2025-01-09 12:07:01,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:07:01,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:07:01,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:07:01,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:07:01,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:07:01,797 INFO L87 Difference]: Start difference. First operand 380 states and 586 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:07:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:07:02,553 INFO L93 Difference]: Finished difference Result 831 states and 1265 transitions. [2025-01-09 12:07:02,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:07:02,554 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2025-01-09 12:07:02,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:07:02,557 INFO L225 Difference]: With dead ends: 831 [2025-01-09 12:07:02,557 INFO L226 Difference]: Without dead ends: 667 [2025-01-09 12:07:02,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-01-09 12:07:02,558 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 334 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:07:02,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 695 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:07:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-01-09 12:07:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 573. [2025-01-09 12:07:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 403 states have (on average 1.382133995037221) internal successors, (557), 404 states have internal predecessors, (557), 160 states have call successors, (160), 9 states have call predecessors, (160), 9 states have return successors, (160), 159 states have call predecessors, (160), 160 states have call successors, (160) [2025-01-09 12:07:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 877 transitions. [2025-01-09 12:07:02,595 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 877 transitions. Word has length 157 [2025-01-09 12:07:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:07:02,595 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 877 transitions. [2025-01-09 12:07:02,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:07:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 877 transitions. [2025-01-09 12:07:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 12:07:02,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:07:02,597 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:02,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:07:02,597 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:07:02,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:07:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash -121183353, now seen corresponding path program 1 times [2025-01-09 12:07:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:07:02,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770615655] [2025-01-09 12:07:02,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:07:02,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:07:02,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 12:07:02,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 12:07:02,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:07:02,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:07:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 12:07:02,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:07:02,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770615655] [2025-01-09 12:07:02,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770615655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:07:02,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:07:02,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:07:02,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793752471] [2025-01-09 12:07:02,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:07:02,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:07:02,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:07:02,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:07:02,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:07:02,892 INFO L87 Difference]: Start difference. First operand 573 states and 877 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:07:02,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:07:02,994 INFO L93 Difference]: Finished difference Result 1274 states and 1915 transitions. [2025-01-09 12:07:02,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:07:02,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2025-01-09 12:07:02,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:07:02,999 INFO L225 Difference]: With dead ends: 1274 [2025-01-09 12:07:02,999 INFO L226 Difference]: Without dead ends: 761 [2025-01-09 12:07:03,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:07:03,000 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 78 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:07:03,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 318 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:07:03,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-01-09 12:07:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 608. [2025-01-09 12:07:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 439 states have (on average 1.3599088838268794) internal successors, (597), 439 states have internal predecessors, (597), 154 states have call successors, (154), 14 states have call predecessors, (154), 14 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 12:07:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 905 transitions. [2025-01-09 12:07:03,033 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 905 transitions. Word has length 157 [2025-01-09 12:07:03,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:07:03,033 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 905 transitions. [2025-01-09 12:07:03,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 12:07:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 905 transitions. [2025-01-09 12:07:03,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 12:07:03,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:07:03,035 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:03,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:07:03,035 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:07:03,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:07:03,035 INFO L85 PathProgramCache]: Analyzing trace with hash 935213513, now seen corresponding path program 1 times [2025-01-09 12:07:03,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:07:03,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17680171] [2025-01-09 12:07:03,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:07:03,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:07:03,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 12:07:03,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 12:07:03,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:07:03,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat