./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.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_variablewrapping_wrapper-sp_file-33.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 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:09:25,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:09:25,238 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:09:25,242 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:09:25,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:09:25,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:09:25,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:09:25,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:09:25,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:09:25,268 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:09:25,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:09:25,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:09:25,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:09:25,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:09:25,269 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:09:25,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:09:25,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:09:25,270 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:09:25,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:09:25,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:09:25,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:09:25,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:09:25,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:09:25,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:09:25,270 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:09:25,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:09:25,270 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:09:25,271 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:09:25,271 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:09:25,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:09:25,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:09:25,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:09:25,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:09:25,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:09:25,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:09:25,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:09:25,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:09:25,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:09:25,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:09:25,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:09:25,272 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:09:25,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:09:25,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:09:25,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:09:25,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:09:25,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:09:25,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:09:25,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:09:25,273 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 -> 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 [2025-01-09 16:09:25,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:09:25,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:09:25,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:09:25,482 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:09:25,482 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:09:25,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2025-01-09 16:09:26,668 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d70c33762/a850eade6eba48f6804fafae0776f0c7/FLAG6a0fdefb4 [2025-01-09 16:09:26,938 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:09:26,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2025-01-09 16:09:26,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d70c33762/a850eade6eba48f6804fafae0776f0c7/FLAG6a0fdefb4 [2025-01-09 16:09:27,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d70c33762/a850eade6eba48f6804fafae0776f0c7 [2025-01-09 16:09:27,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:09:27,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:09:27,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:09:27,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:09:27,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:09:27,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:09:27" (1/1) ... [2025-01-09 16:09:27,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@438165f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27, skipping insertion in model container [2025-01-09 16:09:27,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:09:27" (1/1) ... [2025-01-09 16:09:27,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:09:27,358 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_variablewrapping_wrapper-sp_file-33.i[917,930] [2025-01-09 16:09:27,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:09:27,426 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:09:27,433 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_variablewrapping_wrapper-sp_file-33.i[917,930] [2025-01-09 16:09:27,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:09:27,487 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:09:27,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27 WrapperNode [2025-01-09 16:09:27,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:09:27,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:09:27,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:09:27,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:09:27,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27" (1/1) ... [2025-01-09 16:09:27,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27" (1/1) ... [2025-01-09 16:09:27,543 INFO L138 Inliner]: procedures = 30, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 475 [2025-01-09 16:09:27,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:09:27,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:09:27,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:09:27,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:09:27,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27" (1/1) ... [2025-01-09 16:09:27,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27" (1/1) ... [2025-01-09 16:09:27,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27" (1/1) ... [2025-01-09 16:09:27,568 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:09:27,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27" (1/1) ... [2025-01-09 16:09:27,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27" (1/1) ... [2025-01-09 16:09:27,583 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27" (1/1) ... [2025-01-09 16:09:27,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27" (1/1) ... [2025-01-09 16:09:27,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27" (1/1) ... [2025-01-09 16:09:27,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27" (1/1) ... [2025-01-09 16:09:27,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27" (1/1) ... [2025-01-09 16:09:27,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:09:27,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:09:27,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:09:27,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:09:27,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27" (1/1) ... [2025-01-09 16:09:27,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:09:27,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:09:27,638 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 16:09:27,646 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 16:09:27,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:09:27,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:09:27,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:09:27,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:09:27,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:09:27,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:09:27,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:09:27,663 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:09:27,663 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:09:27,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:09:27,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:09:27,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:09:27,766 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:09:27,768 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:09:28,102 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2025-01-09 16:09:28,102 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:09:28,111 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:09:28,112 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:09:28,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:09:28 BoogieIcfgContainer [2025-01-09 16:09:28,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:09:28,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:09:28,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:09:28,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:09:28,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:09:27" (1/3) ... [2025-01-09 16:09:28,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a19c297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:09:28, skipping insertion in model container [2025-01-09 16:09:28,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:09:27" (2/3) ... [2025-01-09 16:09:28,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a19c297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:09:28, skipping insertion in model container [2025-01-09 16:09:28,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:09:28" (3/3) ... [2025-01-09 16:09:28,120 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-33.i [2025-01-09 16:09:28,130 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:09:28,131 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-33.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:09:28,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:09:28,181 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;@51ccfe94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:09:28,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:09:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 95 states have internal predecessors, (138), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:09:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 16:09:28,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:28,192 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:28,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:28,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash 380790694, now seen corresponding path program 1 times [2025-01-09 16:09:28,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:28,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097605663] [2025-01-09 16:09:28,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:28,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:28,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:09:28,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:09:28,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:28,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 16:09:28,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:28,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097605663] [2025-01-09 16:09:28,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097605663] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:09:28,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549884974] [2025-01-09 16:09:28,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:28,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:09:28,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:09:28,509 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 16:09:28,510 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 16:09:28,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:09:28,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:09:28,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:28,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:28,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:09:28,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:09:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 16:09:28,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:09:28,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549884974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:28,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:09:28,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:09:28,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911491233] [2025-01-09 16:09:28,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:28,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:09:28,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:28,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:09:28,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:09:28,755 INFO L87 Difference]: Start difference. First operand has 106 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 95 states have internal predecessors, (138), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:28,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:28,774 INFO L93 Difference]: Finished difference Result 206 states and 316 transitions. [2025-01-09 16:09:28,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:09:28,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2025-01-09 16:09:28,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:28,780 INFO L225 Difference]: With dead ends: 206 [2025-01-09 16:09:28,780 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 16:09:28,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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 16:09:28,783 INFO L435 NwaCegarLoop]: 151 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, 151 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 16:09:28,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:09:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 16:09:28,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-09 16:09:28,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:09:28,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2025-01-09 16:09:28,808 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 98 [2025-01-09 16:09:28,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:28,808 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2025-01-09 16:09:28,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2025-01-09 16:09:28,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 16:09:28,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:28,811 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:28,818 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 16:09:29,011 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 16:09:29,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:29,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:29,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1709236696, now seen corresponding path program 1 times [2025-01-09 16:09:29,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:29,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575511028] [2025-01-09 16:09:29,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:29,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:29,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:09:29,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:09:29,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:29,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:29,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:29,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575511028] [2025-01-09 16:09:29,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575511028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:29,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:29,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:09:29,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066343346] [2025-01-09 16:09:29,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:29,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:09:29,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:29,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:09:29,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:09:29,247 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:29,322 INFO L93 Difference]: Finished difference Result 206 states and 303 transitions. [2025-01-09 16:09:29,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:09:29,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-01-09 16:09:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:29,324 INFO L225 Difference]: With dead ends: 206 [2025-01-09 16:09:29,324 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 16:09:29,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:09:29,326 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:29,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:09:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 16:09:29,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-01-09 16:09:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:09:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2025-01-09 16:09:29,337 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 98 [2025-01-09 16:09:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:29,338 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2025-01-09 16:09:29,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2025-01-09 16:09:29,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 16:09:29,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:29,342 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:29,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:09:29,343 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:29,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:29,344 INFO L85 PathProgramCache]: Analyzing trace with hash 65770666, now seen corresponding path program 1 times [2025-01-09 16:09:29,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:29,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99010866] [2025-01-09 16:09:29,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:29,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:29,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:09:29,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:09:29,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:29,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:29,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:29,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99010866] [2025-01-09 16:09:29,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99010866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:29,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:29,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:09:29,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950977817] [2025-01-09 16:09:29,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:29,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:09:29,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:29,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:09:29,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:09:29,661 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:29,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:29,810 INFO L93 Difference]: Finished difference Result 262 states and 383 transitions. [2025-01-09 16:09:29,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:09:29,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-01-09 16:09:29,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:29,813 INFO L225 Difference]: With dead ends: 262 [2025-01-09 16:09:29,813 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 16:09:29,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:09:29,814 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 68 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:29,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 512 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:09:29,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 16:09:29,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2025-01-09 16:09:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 111 states have internal predecessors, (161), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:09:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 179 transitions. [2025-01-09 16:09:29,826 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 179 transitions. Word has length 98 [2025-01-09 16:09:29,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:29,827 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 179 transitions. [2025-01-09 16:09:29,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2025-01-09 16:09:29,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 16:09:29,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:29,831 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:29,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:09:29,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:29,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:29,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1214093012, now seen corresponding path program 1 times [2025-01-09 16:09:29,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:29,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777181991] [2025-01-09 16:09:29,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:29,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:29,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:09:29,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:09:29,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:29,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:30,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:30,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777181991] [2025-01-09 16:09:30,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777181991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:30,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:30,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:09:30,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593644238] [2025-01-09 16:09:30,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:30,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:09:30,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:30,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:09:30,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:09:30,584 INFO L87 Difference]: Start difference. First operand 122 states and 179 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:30,860 INFO L93 Difference]: Finished difference Result 281 states and 411 transitions. [2025-01-09 16:09:30,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:09:30,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-01-09 16:09:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:30,862 INFO L225 Difference]: With dead ends: 281 [2025-01-09 16:09:30,862 INFO L226 Difference]: Without dead ends: 162 [2025-01-09 16:09:30,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:09:30,863 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 269 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:30,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 615 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:09:30,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-01-09 16:09:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 124. [2025-01-09 16:09:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 113 states have (on average 1.4424778761061947) internal successors, (163), 113 states have internal predecessors, (163), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:09:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 181 transitions. [2025-01-09 16:09:30,876 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 181 transitions. Word has length 98 [2025-01-09 16:09:30,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:30,877 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 181 transitions. [2025-01-09 16:09:30,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2025-01-09 16:09:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 16:09:30,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:30,878 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:30,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:09:30,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:30,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:30,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1739667668, now seen corresponding path program 1 times [2025-01-09 16:09:30,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:30,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135418598] [2025-01-09 16:09:30,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:30,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:09:30,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:09:30,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:30,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:31,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:31,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135418598] [2025-01-09 16:09:31,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135418598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:31,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:31,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:09:31,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919141014] [2025-01-09 16:09:31,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:31,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:09:31,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:31,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:09:31,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:09:31,602 INFO L87 Difference]: Start difference. First operand 124 states and 181 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:31,901 INFO L93 Difference]: Finished difference Result 292 states and 426 transitions. [2025-01-09 16:09:31,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:09:31,902 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2025-01-09 16:09:31,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:31,903 INFO L225 Difference]: With dead ends: 292 [2025-01-09 16:09:31,904 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 16:09:31,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:09:31,905 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 590 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:31,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 353 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:09:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 16:09:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 130. [2025-01-09 16:09:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 119 states have internal predecessors, (172), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:09:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 190 transitions. [2025-01-09 16:09:31,916 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 190 transitions. Word has length 98 [2025-01-09 16:09:31,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:31,917 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 190 transitions. [2025-01-09 16:09:31,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 190 transitions. [2025-01-09 16:09:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 16:09:31,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:31,918 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:31,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:09:31,918 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:31,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:31,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1275435950, now seen corresponding path program 1 times [2025-01-09 16:09:31,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:31,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151321426] [2025-01-09 16:09:31,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:31,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:31,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:09:32,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:09:32,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:32,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 16:09:32,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:32,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151321426] [2025-01-09 16:09:32,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151321426] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:09:32,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636052641] [2025-01-09 16:09:32,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:32,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:09:32,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:09:32,725 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 16:09:32,727 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 16:09:32,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:09:32,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:09:32,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:32,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:32,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 16:09:32,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:09:32,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2025-01-09 16:09:33,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2025-01-09 16:09:33,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2025-01-09 16:09:33,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2025-01-09 16:09:33,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2025-01-09 16:09:33,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2025-01-09 16:09:34,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:09:34,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 38 [2025-01-09 16:09:34,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:09:34,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 17 [2025-01-09 16:09:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 16:09:34,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:09:34,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636052641] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:09:34,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:09:34,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2025-01-09 16:09:34,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342171521] [2025-01-09 16:09:34,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:09:34,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 16:09:34,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:34,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 16:09:34,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:09:34,257 INFO L87 Difference]: Start difference. First operand 130 states and 190 transitions. Second operand has 18 states, 16 states have (on average 5.8125) internal successors, (93), 18 states have internal predecessors, (93), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-01-09 16:09:35,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:35,028 INFO L93 Difference]: Finished difference Result 400 states and 578 transitions. [2025-01-09 16:09:35,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 16:09:35,029 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.8125) internal successors, (93), 18 states have internal predecessors, (93), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 98 [2025-01-09 16:09:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:35,030 INFO L225 Difference]: With dead ends: 400 [2025-01-09 16:09:35,030 INFO L226 Difference]: Without dead ends: 273 [2025-01-09 16:09:35,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=997, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 16:09:35,032 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 227 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:35,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1037 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:09:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-09 16:09:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 179. [2025-01-09 16:09:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 156 states have (on average 1.3974358974358974) internal successors, (218), 156 states have internal predecessors, (218), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 16:09:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 254 transitions. [2025-01-09 16:09:35,053 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 254 transitions. Word has length 98 [2025-01-09 16:09:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:35,054 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 254 transitions. [2025-01-09 16:09:35,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.8125) internal successors, (93), 18 states have internal predecessors, (93), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-01-09 16:09:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 254 transitions. [2025-01-09 16:09:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 16:09:35,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:35,055 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:35,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:09:35,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:09:35,256 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:35,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:35,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1633327952, now seen corresponding path program 1 times [2025-01-09 16:09:35,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:35,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815898888] [2025-01-09 16:09:35,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:35,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:35,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 16:09:35,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 16:09:35,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:35,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:36,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:36,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815898888] [2025-01-09 16:09:36,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815898888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:36,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:36,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:09:36,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019497974] [2025-01-09 16:09:36,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:36,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:09:36,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:36,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:09:36,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:09:36,739 INFO L87 Difference]: Start difference. First operand 179 states and 254 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:37,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:37,203 INFO L93 Difference]: Finished difference Result 471 states and 679 transitions. [2025-01-09 16:09:37,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:09:37,203 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2025-01-09 16:09:37,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:37,205 INFO L225 Difference]: With dead ends: 471 [2025-01-09 16:09:37,205 INFO L226 Difference]: Without dead ends: 344 [2025-01-09 16:09:37,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:09:37,206 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 256 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:37,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 904 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:09:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-01-09 16:09:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 300. [2025-01-09 16:09:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 267 states have (on average 1.4157303370786516) internal successors, (378), 267 states have internal predecessors, (378), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 432 transitions. [2025-01-09 16:09:37,224 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 432 transitions. Word has length 98 [2025-01-09 16:09:37,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:37,225 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 432 transitions. [2025-01-09 16:09:37,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:37,225 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 432 transitions. [2025-01-09 16:09:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 16:09:37,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:37,225 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:37,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:09:37,226 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:37,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:37,226 INFO L85 PathProgramCache]: Analyzing trace with hash 492938970, now seen corresponding path program 1 times [2025-01-09 16:09:37,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:37,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037926984] [2025-01-09 16:09:37,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:37,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:37,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 16:09:37,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 16:09:37,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:37,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:37,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:37,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037926984] [2025-01-09 16:09:37,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037926984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:37,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:37,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:09:37,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836886127] [2025-01-09 16:09:37,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:37,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:09:37,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:37,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:09:37,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:09:37,418 INFO L87 Difference]: Start difference. First operand 300 states and 432 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:37,743 INFO L93 Difference]: Finished difference Result 648 states and 938 transitions. [2025-01-09 16:09:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:09:37,744 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2025-01-09 16:09:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:37,746 INFO L225 Difference]: With dead ends: 648 [2025-01-09 16:09:37,746 INFO L226 Difference]: Without dead ends: 400 [2025-01-09 16:09:37,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:09:37,747 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 323 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:37,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 546 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:09:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-01-09 16:09:37,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 324. [2025-01-09 16:09:37,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 291 states have (on average 1.4158075601374571) internal successors, (412), 291 states have internal predecessors, (412), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 466 transitions. [2025-01-09 16:09:37,772 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 466 transitions. Word has length 99 [2025-01-09 16:09:37,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:37,772 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 466 transitions. [2025-01-09 16:09:37,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 466 transitions. [2025-01-09 16:09:37,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 16:09:37,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:37,773 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:37,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:09:37,773 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:37,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:37,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1704404059, now seen corresponding path program 1 times [2025-01-09 16:09:37,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:37,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238391616] [2025-01-09 16:09:37,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:37,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:37,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 16:09:37,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 16:09:37,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:37,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:37,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:37,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238391616] [2025-01-09 16:09:37,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238391616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:37,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:37,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:09:37,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618498552] [2025-01-09 16:09:37,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:37,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:09:37,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:37,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:09:37,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:09:37,941 INFO L87 Difference]: Start difference. First operand 324 states and 466 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:38,151 INFO L93 Difference]: Finished difference Result 675 states and 974 transitions. [2025-01-09 16:09:38,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:09:38,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2025-01-09 16:09:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:38,153 INFO L225 Difference]: With dead ends: 675 [2025-01-09 16:09:38,153 INFO L226 Difference]: Without dead ends: 403 [2025-01-09 16:09:38,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:09:38,154 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 267 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:38,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 562 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:09:38,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-01-09 16:09:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 324. [2025-01-09 16:09:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 291 states have (on average 1.402061855670103) internal successors, (408), 291 states have internal predecessors, (408), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 462 transitions. [2025-01-09 16:09:38,175 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 462 transitions. Word has length 99 [2025-01-09 16:09:38,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:38,176 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 462 transitions. [2025-01-09 16:09:38,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:38,177 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 462 transitions. [2025-01-09 16:09:38,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 16:09:38,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:38,177 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:38,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:09:38,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:38,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash 249591337, now seen corresponding path program 1 times [2025-01-09 16:09:38,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:38,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46930697] [2025-01-09 16:09:38,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:38,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:38,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 16:09:38,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 16:09:38,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:38,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:38,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:38,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46930697] [2025-01-09 16:09:38,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46930697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:38,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:38,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:09:38,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408033110] [2025-01-09 16:09:38,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:38,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:09:38,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:38,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:09:38,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:09:38,237 INFO L87 Difference]: Start difference. First operand 324 states and 462 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:38,257 INFO L93 Difference]: Finished difference Result 469 states and 676 transitions. [2025-01-09 16:09:38,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:09:38,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2025-01-09 16:09:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:38,261 INFO L225 Difference]: With dead ends: 469 [2025-01-09 16:09:38,261 INFO L226 Difference]: Without dead ends: 330 [2025-01-09 16:09:38,261 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 16:09:38,262 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:38,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:09:38,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-09 16:09:38,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-01-09 16:09:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 297 states have (on average 1.393939393939394) internal successors, (414), 297 states have internal predecessors, (414), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 468 transitions. [2025-01-09 16:09:38,283 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 468 transitions. Word has length 100 [2025-01-09 16:09:38,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:38,283 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 468 transitions. [2025-01-09 16:09:38,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 468 transitions. [2025-01-09 16:09:38,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 16:09:38,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:38,284 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:38,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:09:38,284 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:38,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1968612661, now seen corresponding path program 1 times [2025-01-09 16:09:38,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:38,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538708478] [2025-01-09 16:09:38,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:38,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:38,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 16:09:38,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 16:09:38,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:38,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:39,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:39,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538708478] [2025-01-09 16:09:39,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538708478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:39,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:39,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:09:39,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249164298] [2025-01-09 16:09:39,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:39,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:09:39,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:39,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:09:39,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:09:39,082 INFO L87 Difference]: Start difference. First operand 330 states and 468 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:39,426 INFO L93 Difference]: Finished difference Result 706 states and 1009 transitions. [2025-01-09 16:09:39,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:09:39,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2025-01-09 16:09:39,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:39,428 INFO L225 Difference]: With dead ends: 706 [2025-01-09 16:09:39,429 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 16:09:39,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:09:39,429 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 568 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:39,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 452 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:09:39,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 16:09:39,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 394. [2025-01-09 16:09:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 361 states have (on average 1.3988919667590027) internal successors, (505), 361 states have internal predecessors, (505), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 559 transitions. [2025-01-09 16:09:39,450 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 559 transitions. Word has length 100 [2025-01-09 16:09:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:39,450 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 559 transitions. [2025-01-09 16:09:39,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 559 transitions. [2025-01-09 16:09:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 16:09:39,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:39,453 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:39,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:09:39,453 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:39,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1315237385, now seen corresponding path program 1 times [2025-01-09 16:09:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:39,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105379101] [2025-01-09 16:09:39,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:39,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:39,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 16:09:39,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 16:09:39,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:39,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 16:09:39,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:39,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105379101] [2025-01-09 16:09:39,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105379101] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:09:39,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743248503] [2025-01-09 16:09:39,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:39,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:09:39,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:09:39,553 INFO L229 MonitoredProcess]: Starting monitored process 4 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 16:09:39,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:09:39,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 16:09:39,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 16:09:39,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:39,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:39,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:09:39,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:09:39,762 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:39,762 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:09:39,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743248503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:39,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:09:39,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 16:09:39,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273493080] [2025-01-09 16:09:39,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:39,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:09:39,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:39,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:09:39,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:09:39,763 INFO L87 Difference]: Start difference. First operand 394 states and 559 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:39,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:39,809 INFO L93 Difference]: Finished difference Result 741 states and 1058 transitions. [2025-01-09 16:09:39,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:09:39,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2025-01-09 16:09:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:39,811 INFO L225 Difference]: With dead ends: 741 [2025-01-09 16:09:39,811 INFO L226 Difference]: Without dead ends: 399 [2025-01-09 16:09:39,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:09:39,812 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:39,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:09:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-01-09 16:09:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-01-09 16:09:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 366 states have (on average 1.3934426229508197) internal successors, (510), 366 states have internal predecessors, (510), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 564 transitions. [2025-01-09 16:09:39,845 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 564 transitions. Word has length 100 [2025-01-09 16:09:39,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:39,847 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 564 transitions. [2025-01-09 16:09:39,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:39,847 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 564 transitions. [2025-01-09 16:09:39,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 16:09:39,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:39,849 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:39,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:09:40,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:09:40,049 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:40,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:40,050 INFO L85 PathProgramCache]: Analyzing trace with hash -396447471, now seen corresponding path program 1 times [2025-01-09 16:09:40,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:40,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652892031] [2025-01-09 16:09:40,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:40,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:40,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 16:09:40,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 16:09:40,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:40,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:40,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:40,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652892031] [2025-01-09 16:09:40,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652892031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:40,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:40,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:09:40,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265022246] [2025-01-09 16:09:40,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:40,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:09:40,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:40,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:09:40,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:09:40,465 INFO L87 Difference]: Start difference. First operand 399 states and 564 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:41,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:41,599 INFO L93 Difference]: Finished difference Result 1113 states and 1570 transitions. [2025-01-09 16:09:41,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 16:09:41,599 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2025-01-09 16:09:41,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:41,601 INFO L225 Difference]: With dead ends: 1113 [2025-01-09 16:09:41,601 INFO L226 Difference]: Without dead ends: 766 [2025-01-09 16:09:41,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2025-01-09 16:09:41,603 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 405 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:41,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1698 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:09:41,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-01-09 16:09:41,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 450. [2025-01-09 16:09:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 417 states have (on average 1.4028776978417266) internal successors, (585), 417 states have internal predecessors, (585), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 639 transitions. [2025-01-09 16:09:41,627 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 639 transitions. Word has length 100 [2025-01-09 16:09:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:41,627 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 639 transitions. [2025-01-09 16:09:41,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 639 transitions. [2025-01-09 16:09:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 16:09:41,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:41,628 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:41,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:09:41,628 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:41,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:41,628 INFO L85 PathProgramCache]: Analyzing trace with hash 749402701, now seen corresponding path program 1 times [2025-01-09 16:09:41,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:41,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329412769] [2025-01-09 16:09:41,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:41,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:41,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 16:09:41,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 16:09:41,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:41,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:42,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:42,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329412769] [2025-01-09 16:09:42,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329412769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:42,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:42,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 16:09:42,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435407279] [2025-01-09 16:09:42,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:42,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:09:42,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:42,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:09:42,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:09:42,094 INFO L87 Difference]: Start difference. First operand 450 states and 639 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:43,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:43,187 INFO L93 Difference]: Finished difference Result 1135 states and 1612 transitions. [2025-01-09 16:09:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 16:09:43,188 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2025-01-09 16:09:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:43,191 INFO L225 Difference]: With dead ends: 1135 [2025-01-09 16:09:43,194 INFO L226 Difference]: Without dead ends: 737 [2025-01-09 16:09:43,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:09:43,196 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 540 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:43,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1166 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:09:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-01-09 16:09:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 489. [2025-01-09 16:09:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 456 states have (on average 1.4144736842105263) internal successors, (645), 456 states have internal predecessors, (645), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 699 transitions. [2025-01-09 16:09:43,239 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 699 transitions. Word has length 100 [2025-01-09 16:09:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:43,239 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 699 transitions. [2025-01-09 16:09:43,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 699 transitions. [2025-01-09 16:09:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:09:43,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:43,241 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:43,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:09:43,241 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:43,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:43,242 INFO L85 PathProgramCache]: Analyzing trace with hash -113174843, now seen corresponding path program 1 times [2025-01-09 16:09:43,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:43,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716974231] [2025-01-09 16:09:43,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:43,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:43,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:09:43,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:09:43,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:43,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:43,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:43,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716974231] [2025-01-09 16:09:43,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716974231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:43,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:43,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:09:43,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345684969] [2025-01-09 16:09:43,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:43,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:09:43,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:43,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:09:43,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:09:43,405 INFO L87 Difference]: Start difference. First operand 489 states and 699 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:43,642 INFO L93 Difference]: Finished difference Result 999 states and 1425 transitions. [2025-01-09 16:09:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:09:43,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-01-09 16:09:43,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:43,644 INFO L225 Difference]: With dead ends: 999 [2025-01-09 16:09:43,644 INFO L226 Difference]: Without dead ends: 562 [2025-01-09 16:09:43,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:09:43,646 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 238 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:43,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 457 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:09:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-01-09 16:09:43,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 480. [2025-01-09 16:09:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 447 states have (on average 1.4026845637583893) internal successors, (627), 447 states have internal predecessors, (627), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 681 transitions. [2025-01-09 16:09:43,669 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 681 transitions. Word has length 101 [2025-01-09 16:09:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:43,670 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 681 transitions. [2025-01-09 16:09:43,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 681 transitions. [2025-01-09 16:09:43,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:09:43,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:43,671 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:43,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:09:43,671 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:43,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:43,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1469306923, now seen corresponding path program 1 times [2025-01-09 16:09:43,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:43,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353527621] [2025-01-09 16:09:43,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:43,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:09:43,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:09:43,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:43,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:44,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:44,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353527621] [2025-01-09 16:09:44,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353527621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:44,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:44,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 16:09:44,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840558054] [2025-01-09 16:09:44,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:44,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:09:44,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:44,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:09:44,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:09:44,137 INFO L87 Difference]: Start difference. First operand 480 states and 681 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:45,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:45,441 INFO L93 Difference]: Finished difference Result 1129 states and 1603 transitions. [2025-01-09 16:09:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 16:09:45,441 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2025-01-09 16:09:45,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:45,443 INFO L225 Difference]: With dead ends: 1129 [2025-01-09 16:09:45,443 INFO L226 Difference]: Without dead ends: 701 [2025-01-09 16:09:45,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:09:45,445 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 418 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:45,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1247 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 16:09:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-01-09 16:09:45,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 531. [2025-01-09 16:09:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 498 states have (on average 1.4156626506024097) internal successors, (705), 498 states have internal predecessors, (705), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 759 transitions. [2025-01-09 16:09:45,489 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 759 transitions. Word has length 101 [2025-01-09 16:09:45,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:45,489 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 759 transitions. [2025-01-09 16:09:45,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:45,489 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 759 transitions. [2025-01-09 16:09:45,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:09:45,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:45,490 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:45,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:09:45,490 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:45,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:45,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1405248085, now seen corresponding path program 1 times [2025-01-09 16:09:45,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:45,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684143422] [2025-01-09 16:09:45,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:45,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:45,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:09:45,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:09:45,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:45,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:46,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:46,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684143422] [2025-01-09 16:09:46,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684143422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:46,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:46,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:09:46,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792882746] [2025-01-09 16:09:46,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:46,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:09:46,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:46,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:09:46,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:09:46,296 INFO L87 Difference]: Start difference. First operand 531 states and 759 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 16:09:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:46,531 INFO L93 Difference]: Finished difference Result 992 states and 1422 transitions. [2025-01-09 16:09:46,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:09:46,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 101 [2025-01-09 16:09:46,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:46,533 INFO L225 Difference]: With dead ends: 992 [2025-01-09 16:09:46,533 INFO L226 Difference]: Without dead ends: 513 [2025-01-09 16:09:46,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:09:46,534 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 312 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:46,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 292 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:09:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-01-09 16:09:46,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 509. [2025-01-09 16:09:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 476 states have (on average 1.4075630252100841) internal successors, (670), 476 states have internal predecessors, (670), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 724 transitions. [2025-01-09 16:09:46,553 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 724 transitions. Word has length 101 [2025-01-09 16:09:46,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:46,553 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 724 transitions. [2025-01-09 16:09:46,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 16:09:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 724 transitions. [2025-01-09 16:09:46,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 16:09:46,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:46,554 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:46,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:09:46,554 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:46,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:46,554 INFO L85 PathProgramCache]: Analyzing trace with hash 756364323, now seen corresponding path program 1 times [2025-01-09 16:09:46,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:46,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124452311] [2025-01-09 16:09:46,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:46,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:46,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 16:09:46,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 16:09:46,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:46,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:46,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:46,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124452311] [2025-01-09 16:09:46,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124452311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:46,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:46,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:09:46,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74177563] [2025-01-09 16:09:46,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:46,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:09:46,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:46,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:09:46,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:09:46,795 INFO L87 Difference]: Start difference. First operand 509 states and 724 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:47,398 INFO L93 Difference]: Finished difference Result 1270 states and 1798 transitions. [2025-01-09 16:09:47,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:09:47,399 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2025-01-09 16:09:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:47,401 INFO L225 Difference]: With dead ends: 1270 [2025-01-09 16:09:47,401 INFO L226 Difference]: Without dead ends: 813 [2025-01-09 16:09:47,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:09:47,402 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 415 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:47,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1220 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:09:47,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-01-09 16:09:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 519. [2025-01-09 16:09:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 486 states have (on average 1.4156378600823045) internal successors, (688), 486 states have internal predecessors, (688), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 742 transitions. [2025-01-09 16:09:47,424 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 742 transitions. Word has length 102 [2025-01-09 16:09:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:47,424 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 742 transitions. [2025-01-09 16:09:47,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 742 transitions. [2025-01-09 16:09:47,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 16:09:47,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:47,425 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:47,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 16:09:47,425 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:47,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:47,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1373764462, now seen corresponding path program 1 times [2025-01-09 16:09:47,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:47,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265186382] [2025-01-09 16:09:47,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:47,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:47,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 16:09:47,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 16:09:47,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:47,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:47,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265186382] [2025-01-09 16:09:47,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265186382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:47,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:47,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:09:47,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442855935] [2025-01-09 16:09:47,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:47,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:09:47,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:47,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:09:47,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:09:47,843 INFO L87 Difference]: Start difference. First operand 519 states and 742 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:48,548 INFO L93 Difference]: Finished difference Result 1141 states and 1620 transitions. [2025-01-09 16:09:48,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:09:48,549 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2025-01-09 16:09:48,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:48,550 INFO L225 Difference]: With dead ends: 1141 [2025-01-09 16:09:48,551 INFO L226 Difference]: Without dead ends: 659 [2025-01-09 16:09:48,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2025-01-09 16:09:48,552 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 364 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:48,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1243 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:09:48,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-01-09 16:09:48,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 519. [2025-01-09 16:09:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 486 states have (on average 1.4012345679012346) internal successors, (681), 486 states have internal predecessors, (681), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 735 transitions. [2025-01-09 16:09:48,571 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 735 transitions. Word has length 102 [2025-01-09 16:09:48,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:48,572 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 735 transitions. [2025-01-09 16:09:48,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 735 transitions. [2025-01-09 16:09:48,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 16:09:48,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:48,573 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:48,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 16:09:48,573 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:48,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:48,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1775352662, now seen corresponding path program 1 times [2025-01-09 16:09:48,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:48,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976250281] [2025-01-09 16:09:48,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:48,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:48,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 16:09:48,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 16:09:48,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:48,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:48,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:48,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976250281] [2025-01-09 16:09:48,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976250281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:48,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:48,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 16:09:48,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483920437] [2025-01-09 16:09:48,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:48,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:09:48,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:48,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:09:48,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:09:48,963 INFO L87 Difference]: Start difference. First operand 519 states and 735 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:49,809 INFO L93 Difference]: Finished difference Result 1413 states and 1994 transitions. [2025-01-09 16:09:49,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:09:49,809 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 102 [2025-01-09 16:09:49,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:49,813 INFO L225 Difference]: With dead ends: 1413 [2025-01-09 16:09:49,813 INFO L226 Difference]: Without dead ends: 946 [2025-01-09 16:09:49,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2025-01-09 16:09:49,814 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 391 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:49,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1145 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 16:09:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-01-09 16:09:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 583. [2025-01-09 16:09:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 550 states have (on average 1.4181818181818182) internal successors, (780), 550 states have internal predecessors, (780), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 834 transitions. [2025-01-09 16:09:49,841 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 834 transitions. Word has length 102 [2025-01-09 16:09:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:49,841 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 834 transitions. [2025-01-09 16:09:49,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 834 transitions. [2025-01-09 16:09:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:09:49,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:49,842 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:49,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 16:09:49,842 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:49,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:49,843 INFO L85 PathProgramCache]: Analyzing trace with hash -174157312, now seen corresponding path program 1 times [2025-01-09 16:09:49,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:49,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135977779] [2025-01-09 16:09:49,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:49,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:49,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:09:49,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:09:49,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:49,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:49,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:49,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135977779] [2025-01-09 16:09:49,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135977779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:49,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:49,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:09:49,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281111225] [2025-01-09 16:09:49,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:49,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:09:49,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:49,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:09:49,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:09:49,977 INFO L87 Difference]: Start difference. First operand 583 states and 834 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:50,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:50,188 INFO L93 Difference]: Finished difference Result 1100 states and 1566 transitions. [2025-01-09 16:09:50,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:09:50,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2025-01-09 16:09:50,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:50,191 INFO L225 Difference]: With dead ends: 1100 [2025-01-09 16:09:50,191 INFO L226 Difference]: Without dead ends: 753 [2025-01-09 16:09:50,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:09:50,193 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 194 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:50,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 543 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:09:50,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-01-09 16:09:50,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 583. [2025-01-09 16:09:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 550 states have (on average 1.4163636363636363) internal successors, (779), 550 states have internal predecessors, (779), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:50,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 833 transitions. [2025-01-09 16:09:50,215 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 833 transitions. Word has length 103 [2025-01-09 16:09:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:50,215 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 833 transitions. [2025-01-09 16:09:50,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 833 transitions. [2025-01-09 16:09:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:09:50,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:50,216 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:50,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 16:09:50,216 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:50,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:50,216 INFO L85 PathProgramCache]: Analyzing trace with hash -555385064, now seen corresponding path program 1 times [2025-01-09 16:09:50,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:50,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536248669] [2025-01-09 16:09:50,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:50,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:50,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:09:50,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:09:50,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:50,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:50,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536248669] [2025-01-09 16:09:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536248669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:50,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:50,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:09:50,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904416073] [2025-01-09 16:09:50,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:50,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:09:50,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:50,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:09:50,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:09:50,563 INFO L87 Difference]: Start difference. First operand 583 states and 833 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:51,224 INFO L93 Difference]: Finished difference Result 1301 states and 1863 transitions. [2025-01-09 16:09:51,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:09:51,224 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2025-01-09 16:09:51,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:51,226 INFO L225 Difference]: With dead ends: 1301 [2025-01-09 16:09:51,226 INFO L226 Difference]: Without dead ends: 770 [2025-01-09 16:09:51,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:09:51,228 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 208 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:51,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1131 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:09:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-01-09 16:09:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 582. [2025-01-09 16:09:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 549 states have (on average 1.4116575591985427) internal successors, (775), 549 states have internal predecessors, (775), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 829 transitions. [2025-01-09 16:09:51,249 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 829 transitions. Word has length 103 [2025-01-09 16:09:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:51,249 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 829 transitions. [2025-01-09 16:09:51,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 829 transitions. [2025-01-09 16:09:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:09:51,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:51,250 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:51,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 16:09:51,251 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:51,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:51,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1931714286, now seen corresponding path program 1 times [2025-01-09 16:09:51,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:51,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474925148] [2025-01-09 16:09:51,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:51,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:51,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:09:51,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:09:51,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:51,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:51,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:51,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474925148] [2025-01-09 16:09:51,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474925148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:51,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:51,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:09:51,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541359031] [2025-01-09 16:09:51,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:51,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:09:51,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:51,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:09:51,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:09:51,571 INFO L87 Difference]: Start difference. First operand 582 states and 829 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:52,212 INFO L93 Difference]: Finished difference Result 1520 states and 2145 transitions. [2025-01-09 16:09:52,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:09:52,212 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2025-01-09 16:09:52,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:52,215 INFO L225 Difference]: With dead ends: 1520 [2025-01-09 16:09:52,215 INFO L226 Difference]: Without dead ends: 990 [2025-01-09 16:09:52,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:09:52,217 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 289 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:52,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1339 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:09:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-01-09 16:09:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 585. [2025-01-09 16:09:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 552 states have (on average 1.414855072463768) internal successors, (781), 552 states have internal predecessors, (781), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 835 transitions. [2025-01-09 16:09:52,238 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 835 transitions. Word has length 103 [2025-01-09 16:09:52,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:52,238 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 835 transitions. [2025-01-09 16:09:52,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:52,238 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 835 transitions. [2025-01-09 16:09:52,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:09:52,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:52,239 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:52,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 16:09:52,239 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:52,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1283993015, now seen corresponding path program 1 times [2025-01-09 16:09:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:52,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867152875] [2025-01-09 16:09:52,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:52,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:52,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:09:52,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:09:52,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:52,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:52,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:52,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867152875] [2025-01-09 16:09:52,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867152875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:52,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:52,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:09:52,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365007642] [2025-01-09 16:09:52,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:52,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:09:52,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:52,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:09:52,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:09:52,696 INFO L87 Difference]: Start difference. First operand 585 states and 835 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:53,384 INFO L93 Difference]: Finished difference Result 1516 states and 2157 transitions. [2025-01-09 16:09:53,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:09:53,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 103 [2025-01-09 16:09:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:53,387 INFO L225 Difference]: With dead ends: 1516 [2025-01-09 16:09:53,387 INFO L226 Difference]: Without dead ends: 950 [2025-01-09 16:09:53,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:09:53,388 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 406 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:53,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1033 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:09:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-01-09 16:09:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 577. [2025-01-09 16:09:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 544 states have (on average 1.3970588235294117) internal successors, (760), 544 states have internal predecessors, (760), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 814 transitions. [2025-01-09 16:09:53,409 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 814 transitions. Word has length 103 [2025-01-09 16:09:53,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:53,409 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 814 transitions. [2025-01-09 16:09:53,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 814 transitions. [2025-01-09 16:09:53,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:09:53,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:53,410 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:53,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 16:09:53,410 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:53,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:53,410 INFO L85 PathProgramCache]: Analyzing trace with hash 690630095, now seen corresponding path program 1 times [2025-01-09 16:09:53,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:53,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076978567] [2025-01-09 16:09:53,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:53,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:53,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:09:53,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:09:53,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:53,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:53,499 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 16:09:53,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:53,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076978567] [2025-01-09 16:09:53,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076978567] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:09:53,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467512763] [2025-01-09 16:09:53,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:53,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:09:53,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:09:53,502 INFO L229 MonitoredProcess]: Starting monitored process 5 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 16:09:53,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:09:53,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:09:53,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:09:53,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:53,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:53,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:09:53,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:09:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:53,739 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:09:53,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467512763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:53,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:09:53,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 16:09:53,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936755948] [2025-01-09 16:09:53,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:53,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:09:53,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:53,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:09:53,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:09:53,740 INFO L87 Difference]: Start difference. First operand 577 states and 814 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:53,771 INFO L93 Difference]: Finished difference Result 1108 states and 1569 transitions. [2025-01-09 16:09:53,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:09:53,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2025-01-09 16:09:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:53,773 INFO L225 Difference]: With dead ends: 1108 [2025-01-09 16:09:53,773 INFO L226 Difference]: Without dead ends: 583 [2025-01-09 16:09:53,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:09:53,774 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:53,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:09:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-01-09 16:09:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2025-01-09 16:09:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 550 states have (on average 1.3927272727272728) internal successors, (766), 550 states have internal predecessors, (766), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 820 transitions. [2025-01-09 16:09:53,810 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 820 transitions. Word has length 104 [2025-01-09 16:09:53,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:53,810 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 820 transitions. [2025-01-09 16:09:53,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:53,810 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 820 transitions. [2025-01-09 16:09:53,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:09:53,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:53,811 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:53,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:09:54,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 16:09:54,015 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:54,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:54,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1756487496, now seen corresponding path program 1 times [2025-01-09 16:09:54,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:54,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290662369] [2025-01-09 16:09:54,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:54,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:54,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:09:54,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:09:54,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:54,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:54,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:54,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290662369] [2025-01-09 16:09:54,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290662369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:54,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:54,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:09:54,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271761414] [2025-01-09 16:09:54,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:54,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:09:54,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:54,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:09:54,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:09:54,400 INFO L87 Difference]: Start difference. First operand 583 states and 820 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:54,930 INFO L93 Difference]: Finished difference Result 1000 states and 1413 transitions. [2025-01-09 16:09:54,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:09:54,930 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2025-01-09 16:09:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:54,932 INFO L225 Difference]: With dead ends: 1000 [2025-01-09 16:09:54,932 INFO L226 Difference]: Without dead ends: 660 [2025-01-09 16:09:54,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:09:54,933 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 250 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:54,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 893 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:09:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-09 16:09:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 600. [2025-01-09 16:09:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 567 states have (on average 1.4056437389770724) internal successors, (797), 567 states have internal predecessors, (797), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 851 transitions. [2025-01-09 16:09:54,953 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 851 transitions. Word has length 104 [2025-01-09 16:09:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:54,954 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 851 transitions. [2025-01-09 16:09:54,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 851 transitions. [2025-01-09 16:09:54,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:09:54,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:54,955 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:54,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 16:09:54,955 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:54,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:54,955 INFO L85 PathProgramCache]: Analyzing trace with hash 476623818, now seen corresponding path program 1 times [2025-01-09 16:09:54,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:54,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929463436] [2025-01-09 16:09:54,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:54,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:54,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:09:54,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:09:54,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:54,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:55,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:55,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929463436] [2025-01-09 16:09:55,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929463436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:55,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:55,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:09:55,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572137868] [2025-01-09 16:09:55,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:55,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:09:55,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:55,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:09:55,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:09:55,982 INFO L87 Difference]: Start difference. First operand 600 states and 851 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:56,258 INFO L93 Difference]: Finished difference Result 1377 states and 1962 transitions. [2025-01-09 16:09:56,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:09:56,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 104 [2025-01-09 16:09:56,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:56,261 INFO L225 Difference]: With dead ends: 1377 [2025-01-09 16:09:56,261 INFO L226 Difference]: Without dead ends: 829 [2025-01-09 16:09:56,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:09:56,262 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 378 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:56,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 384 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:09:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-01-09 16:09:56,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 764. [2025-01-09 16:09:56,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 721 states have (on average 1.3841886269070736) internal successors, (998), 721 states have internal predecessors, (998), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:09:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1070 transitions. [2025-01-09 16:09:56,289 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1070 transitions. Word has length 104 [2025-01-09 16:09:56,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:56,289 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1070 transitions. [2025-01-09 16:09:56,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:56,289 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1070 transitions. [2025-01-09 16:09:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:09:56,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:56,290 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:56,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 16:09:56,290 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:56,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:56,290 INFO L85 PathProgramCache]: Analyzing trace with hash -393790714, now seen corresponding path program 1 times [2025-01-09 16:09:56,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:56,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446739628] [2025-01-09 16:09:56,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:56,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:56,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:09:56,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:09:56,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:56,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:56,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:56,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446739628] [2025-01-09 16:09:56,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446739628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:56,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:56,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:09:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071265861] [2025-01-09 16:09:56,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:56,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:09:56,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:56,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:09:56,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:09:56,547 INFO L87 Difference]: Start difference. First operand 764 states and 1070 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:57,215 INFO L93 Difference]: Finished difference Result 1896 states and 2643 transitions. [2025-01-09 16:09:57,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:09:57,216 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2025-01-09 16:09:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:57,219 INFO L225 Difference]: With dead ends: 1896 [2025-01-09 16:09:57,219 INFO L226 Difference]: Without dead ends: 1184 [2025-01-09 16:09:57,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:09:57,220 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 391 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:57,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1208 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:09:57,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2025-01-09 16:09:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 782. [2025-01-09 16:09:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 739 states have (on average 1.388362652232747) internal successors, (1026), 739 states have internal predecessors, (1026), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:09:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1098 transitions. [2025-01-09 16:09:57,249 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1098 transitions. Word has length 104 [2025-01-09 16:09:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:57,249 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1098 transitions. [2025-01-09 16:09:57,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1098 transitions. [2025-01-09 16:09:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 16:09:57,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:57,250 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:57,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 16:09:57,250 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:57,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:57,250 INFO L85 PathProgramCache]: Analyzing trace with hash -346451707, now seen corresponding path program 1 times [2025-01-09 16:09:57,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:57,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711915802] [2025-01-09 16:09:57,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:57,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:57,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 16:09:57,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 16:09:57,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:57,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:57,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:57,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711915802] [2025-01-09 16:09:57,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711915802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:57,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:57,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:09:57,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706402389] [2025-01-09 16:09:57,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:57,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:09:57,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:57,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:09:57,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:09:57,460 INFO L87 Difference]: Start difference. First operand 782 states and 1098 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:57,825 INFO L93 Difference]: Finished difference Result 1455 states and 2048 transitions. [2025-01-09 16:09:57,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:09:57,825 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2025-01-09 16:09:57,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:57,828 INFO L225 Difference]: With dead ends: 1455 [2025-01-09 16:09:57,828 INFO L226 Difference]: Without dead ends: 905 [2025-01-09 16:09:57,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:09:57,829 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 245 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:57,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 764 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:09:57,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-01-09 16:09:57,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 795. [2025-01-09 16:09:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 752 states have (on average 1.3936170212765957) internal successors, (1048), 752 states have internal predecessors, (1048), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:09:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1120 transitions. [2025-01-09 16:09:57,858 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1120 transitions. Word has length 105 [2025-01-09 16:09:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:57,858 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1120 transitions. [2025-01-09 16:09:57,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:09:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1120 transitions. [2025-01-09 16:09:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 16:09:57,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:57,859 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:57,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 16:09:57,859 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:57,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:57,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1626315385, now seen corresponding path program 1 times [2025-01-09 16:09:57,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:57,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682631521] [2025-01-09 16:09:57,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:57,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:57,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 16:09:57,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 16:09:57,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:57,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:58,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:58,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682631521] [2025-01-09 16:09:58,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682631521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:58,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:58,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:09:58,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118863939] [2025-01-09 16:09:58,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:58,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:09:58,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:58,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:09:58,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:09:58,767 INFO L87 Difference]: Start difference. First operand 795 states and 1120 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:59,066 INFO L93 Difference]: Finished difference Result 1368 states and 1933 transitions. [2025-01-09 16:09:59,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:09:59,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 105 [2025-01-09 16:09:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:59,069 INFO L225 Difference]: With dead ends: 1368 [2025-01-09 16:09:59,069 INFO L226 Difference]: Without dead ends: 808 [2025-01-09 16:09:59,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:09:59,071 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 120 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:59,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 706 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:09:59,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-01-09 16:09:59,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 794. [2025-01-09 16:09:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 751 states have (on average 1.3901464713715046) internal successors, (1044), 751 states have internal predecessors, (1044), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:09:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1116 transitions. [2025-01-09 16:09:59,111 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1116 transitions. Word has length 105 [2025-01-09 16:09:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:59,111 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1116 transitions. [2025-01-09 16:09:59,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:09:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1116 transitions. [2025-01-09 16:09:59,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 16:09:59,112 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:59,112 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:59,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 16:09:59,113 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:59,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:59,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1735433403, now seen corresponding path program 1 times [2025-01-09 16:09:59,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:59,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252644718] [2025-01-09 16:09:59,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:59,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:59,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 16:09:59,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 16:09:59,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:59,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:09:59,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:59,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252644718] [2025-01-09 16:09:59,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252644718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:59,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:59,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:09:59,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349573715] [2025-01-09 16:09:59,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:59,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:09:59,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:59,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:09:59,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:09:59,746 INFO L87 Difference]: Start difference. First operand 794 states and 1116 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:10:00,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:10:00,545 INFO L93 Difference]: Finished difference Result 1872 states and 2616 transitions. [2025-01-09 16:10:00,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 16:10:00,545 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 105 [2025-01-09 16:10:00,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:10:00,548 INFO L225 Difference]: With dead ends: 1872 [2025-01-09 16:10:00,548 INFO L226 Difference]: Without dead ends: 1130 [2025-01-09 16:10:00,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2025-01-09 16:10:00,550 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 468 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:10:00,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 718 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:10:00,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-01-09 16:10:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 792. [2025-01-09 16:10:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 749 states have (on average 1.3885180240320427) internal successors, (1040), 749 states have internal predecessors, (1040), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:10:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1112 transitions. [2025-01-09 16:10:00,605 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1112 transitions. Word has length 105 [2025-01-09 16:10:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:10:00,605 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1112 transitions. [2025-01-09 16:10:00,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:10:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1112 transitions. [2025-01-09 16:10:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 16:10:00,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:10:00,606 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:10:00,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 16:10:00,606 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:10:00,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:10:00,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2026734144, now seen corresponding path program 1 times [2025-01-09 16:10:00,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:10:00,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431227618] [2025-01-09 16:10:00,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:10:00,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:10:00,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 16:10:00,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 16:10:00,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:10:00,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:10:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:10:00,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:10:00,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431227618] [2025-01-09 16:10:00,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431227618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:10:00,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:10:00,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:10:00,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904492266] [2025-01-09 16:10:00,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:10:00,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:10:00,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:10:00,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:10:00,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:10:00,952 INFO L87 Difference]: Start difference. First operand 792 states and 1112 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:10:01,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:10:01,275 INFO L93 Difference]: Finished difference Result 1421 states and 2009 transitions. [2025-01-09 16:10:01,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:10:01,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2025-01-09 16:10:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:10:01,277 INFO L225 Difference]: With dead ends: 1421 [2025-01-09 16:10:01,277 INFO L226 Difference]: Without dead ends: 681 [2025-01-09 16:10:01,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:10:01,279 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 131 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:10:01,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 518 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:10:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-01-09 16:10:01,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2025-01-09 16:10:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 638 states have (on average 1.3793103448275863) internal successors, (880), 638 states have internal predecessors, (880), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:10:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 952 transitions. [2025-01-09 16:10:01,306 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 952 transitions. Word has length 105 [2025-01-09 16:10:01,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:10:01,306 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 952 transitions. [2025-01-09 16:10:01,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:10:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 952 transitions. [2025-01-09 16:10:01,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 16:10:01,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:10:01,307 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:10:01,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 16:10:01,307 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:10:01,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:10:01,307 INFO L85 PathProgramCache]: Analyzing trace with hash -458875119, now seen corresponding path program 1 times [2025-01-09 16:10:01,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:10:01,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809500143] [2025-01-09 16:10:01,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:10:01,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:10:01,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 16:10:01,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 16:10:01,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:10:01,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:10:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:10:01,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:10:01,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809500143] [2025-01-09 16:10:01,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809500143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:10:01,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:10:01,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 16:10:01,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872721874] [2025-01-09 16:10:01,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:10:01,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:10:01,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:10:01,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:10:01,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:10:01,811 INFO L87 Difference]: Start difference. First operand 681 states and 952 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:10:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:10:02,669 INFO L93 Difference]: Finished difference Result 1608 states and 2228 transitions. [2025-01-09 16:10:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 16:10:02,669 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 105 [2025-01-09 16:10:02,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:10:02,672 INFO L225 Difference]: With dead ends: 1608 [2025-01-09 16:10:02,672 INFO L226 Difference]: Without dead ends: 979 [2025-01-09 16:10:02,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:10:02,673 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 601 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:10:02,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1056 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:10:02,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-01-09 16:10:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 680. [2025-01-09 16:10:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 637 states have (on average 1.3783359497645211) internal successors, (878), 637 states have internal predecessors, (878), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:10:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 950 transitions. [2025-01-09 16:10:02,719 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 950 transitions. Word has length 105 [2025-01-09 16:10:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:10:02,719 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 950 transitions. [2025-01-09 16:10:02,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:10:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 950 transitions. [2025-01-09 16:10:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 16:10:02,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:10:02,720 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:10:02,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 16:10:02,720 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:10:02,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:10:02,721 INFO L85 PathProgramCache]: Analyzing trace with hash 382912948, now seen corresponding path program 1 times [2025-01-09 16:10:02,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:10:02,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027705748] [2025-01-09 16:10:02,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:10:02,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:10:02,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:10:02,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:10:02,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:10:02,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:10:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:10:02,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:10:02,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027705748] [2025-01-09 16:10:02,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027705748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:10:02,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:10:02,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:10:02,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034505720] [2025-01-09 16:10:02,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:10:02,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:10:02,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:10:02,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:10:02,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:10:02,772 INFO L87 Difference]: Start difference. First operand 680 states and 950 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:10:02,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:10:02,799 INFO L93 Difference]: Finished difference Result 1311 states and 1839 transitions. [2025-01-09 16:10:02,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:10:02,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 106 [2025-01-09 16:10:02,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:10:02,802 INFO L225 Difference]: With dead ends: 1311 [2025-01-09 16:10:02,802 INFO L226 Difference]: Without dead ends: 683 [2025-01-09 16:10:02,803 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 16:10:02,803 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:10:02,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:10:02,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-01-09 16:10:02,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2025-01-09 16:10:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 640 states have (on average 1.3765625) internal successors, (881), 640 states have internal predecessors, (881), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:10:02,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 953 transitions. [2025-01-09 16:10:02,829 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 953 transitions. Word has length 106 [2025-01-09 16:10:02,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:10:02,829 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 953 transitions. [2025-01-09 16:10:02,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:10:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 953 transitions. [2025-01-09 16:10:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 16:10:02,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:10:02,830 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:10:02,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 16:10:02,830 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:10:02,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:10:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash -219646776, now seen corresponding path program 1 times [2025-01-09 16:10:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:10:02,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347441132] [2025-01-09 16:10:02,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:10:02,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:10:02,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:10:02,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:10:02,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:10:02,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:10:02,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:10:02,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:10:02,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:10:02,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:10:02,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:10:03,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:10:03,003 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:10:03,004 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:10:03,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 16:10:03,008 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:10:03,108 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:10:03,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:10:03 BoogieIcfgContainer [2025-01-09 16:10:03,111 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:10:03,112 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:10:03,112 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:10:03,112 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:10:03,113 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:09:28" (3/4) ... [2025-01-09 16:10:03,114 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:10:03,114 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:10:03,115 INFO L158 Benchmark]: Toolchain (without parser) took 35886.68ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 131.9MB in the beginning and 204.5MB in the end (delta: -72.6MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2025-01-09 16:10:03,115 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 218.1MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:10:03,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.27ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 117.1MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:10:03,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.90ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 112.9MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:10:03,116 INFO L158 Benchmark]: Boogie Preprocessor took 59.37ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 109.8MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:10:03,117 INFO L158 Benchmark]: RCFGBuilder took 506.90ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 73.9MB in the end (delta: 35.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:10:03,117 INFO L158 Benchmark]: TraceAbstraction took 34996.23ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 73.9MB in the beginning and 204.6MB in the end (delta: -130.7MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. [2025-01-09 16:10:03,118 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 302.0MB. Free memory was 204.6MB in the beginning and 204.5MB in the end (delta: 92.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:10:03,118 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 218.1MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.27ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 117.1MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.90ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 112.9MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.37ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 109.8MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 506.90ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 73.9MB in the end (delta: 35.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 34996.23ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 73.9MB in the beginning and 204.6MB in the end (delta: -130.7MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 302.0MB. Free memory was 204.6MB in the beginning and 204.5MB in the end (delta: 92.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someUnaryDOUBLEoperation at line 43. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L51] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] signed short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L53] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L54] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L55] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L56] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L57] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L58] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L59] signed long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L60] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L61] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L62] signed long int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L63] signed long int last_1_WrapperStruct00_var_1_13 = -8; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=0, last_1_WrapperStruct00_var_1_13=-8] [L117] isInitial = 1 [L118] FCALL initially() [L120] CALL updateLastVariables() [L110] EXPR WrapperStruct00.var_1_13 [L110] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L120] RET updateLastVariables() [L121] CALL updateVariables() [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L94] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L96] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L100] EXPR WrapperStruct00.var_1_10 [L100] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_10 [L100] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_11 [L102] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_11 [L102] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L103] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_12 [L104] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_12 [L104] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L105] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L107] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L121] RET updateVariables() [L122] CALL step() [L67] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L67] COND FALSE !((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) [L70] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L70] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L71] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_7_Pointer)); [L72] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L72] COND TRUE ! (*(WrapperStruct00_var_1_14_Pointer)) [L73] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L73] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L81] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_11_Pointer)) [L82] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L82] EXPR (*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L82] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L82] signed long int stepLocal_0 = ((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer)); [L83] COND FALSE !(stepLocal_0 < -1) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] (*(WrapperStruct00_var_1_1_Pointer)) = (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L88] EXPR (*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L88] EXPR (*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L88] COND FALSE !((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) [L122] RET step() [L123] CALL, EXPR property() [L113] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))))) [L113] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1) [L113] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))))) [L113] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))) [L113] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L113] EXPR (! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer)))) [L113] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L113] EXPR ((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113-L114] return (((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.8s, OverallIterations: 35, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9333 SdHoareTripleChecker+Valid, 11.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9333 mSDsluCounter, 26061 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21201 mSDsCounter, 395 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15269 IncrementalHoareTripleChecker+Invalid, 15664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 395 mSolverCounterUnsat, 4860 mSDtfsCounter, 15269 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 995 GetRequests, 550 SyntacticMatches, 9 SemanticMatches, 436 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=795occurred in iteration=29, InterpolantAutomatonStates: 302, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 34 MinimizatonAttempts, 4486 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 3958 NumberOfCodeBlocks, 3958 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3814 ConstructedInterpolants, 0 QuantifiedInterpolants, 31297 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1782 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 38 InterpolantComputations, 33 PerfectInterpolantSequences, 5322/5472 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 16:10:03,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_variablewrapping_wrapper-sp_file-33.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:10:05,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:10:05,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 16:10:05,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:10:05,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:10:05,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:10:05,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:10:05,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:10:05,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:10:05,140 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:10:05,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:10:05,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:10:05,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:10:05,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:10:05,141 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:10:05,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:10:05,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:10:05,141 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:10:05,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:10:05,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:10:05,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:10:05,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:10:05,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:10:05,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:10:05,141 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:10:05,142 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:10:05,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:10:05,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:10:05,142 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:10:05,143 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:10:05,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:10:05,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:10:05,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:10:05,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:10:05,143 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 -> 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 [2025-01-09 16:10:05,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:10:05,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:10:05,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:10:05,360 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:10:05,360 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:10:05,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2025-01-09 16:10:06,602 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4862f959e/2cc77f64ab0b47d4b326124528bc8421/FLAGbe4f08c1b [2025-01-09 16:10:06,751 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:10:06,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2025-01-09 16:10:06,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4862f959e/2cc77f64ab0b47d4b326124528bc8421/FLAGbe4f08c1b [2025-01-09 16:10:06,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4862f959e/2cc77f64ab0b47d4b326124528bc8421 [2025-01-09 16:10:06,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:10:06,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:10:06,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:10:06,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:10:06,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:10:06,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:10:06" (1/1) ... [2025-01-09 16:10:06,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a10ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:06, skipping insertion in model container [2025-01-09 16:10:06,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:10:06" (1/1) ... [2025-01-09 16:10:06,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:10:06,927 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_variablewrapping_wrapper-sp_file-33.i[917,930] [2025-01-09 16:10:06,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:10:06,994 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:10:07,002 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_variablewrapping_wrapper-sp_file-33.i[917,930] [2025-01-09 16:10:07,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:10:07,046 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:10:07,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:07 WrapperNode [2025-01-09 16:10:07,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:10:07,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:10:07,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:10:07,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:10:07,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:07" (1/1) ... [2025-01-09 16:10:07,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:07" (1/1) ... [2025-01-09 16:10:07,087 INFO L138 Inliner]: procedures = 37, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 416 [2025-01-09 16:10:07,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:10:07,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:10:07,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:10:07,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:10:07,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:07" (1/1) ... [2025-01-09 16:10:07,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:07" (1/1) ... [2025-01-09 16:10:07,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:07" (1/1) ... [2025-01-09 16:10:07,124 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 28 writes are split as follows [0, 28]. [2025-01-09 16:10:07,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:07" (1/1) ... [2025-01-09 16:10:07,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:07" (1/1) ... [2025-01-09 16:10:07,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:07" (1/1) ... [2025-01-09 16:10:07,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:07" (1/1) ... [2025-01-09 16:10:07,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:07" (1/1) ... [2025-01-09 16:10:07,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:07" (1/1) ... [2025-01-09 16:10:07,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:07" (1/1) ... [2025-01-09 16:10:07,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:10:07,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:10:07,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:10:07,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:10:07,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:07" (1/1) ... [2025-01-09 16:10:07,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:10:07,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:10:07,178 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 16:10:07,182 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 16:10:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:10:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:10:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:10:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:10:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:10:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 16:10:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 16:10:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:10:07,199 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:10:07,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 16:10:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 16:10:07,323 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:10:07,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:10:11,764 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2025-01-09 16:10:11,765 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:10:11,773 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:10:11,773 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:10:11,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:10:11 BoogieIcfgContainer [2025-01-09 16:10:11,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:10:11,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:10:11,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:10:11,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:10:11,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:10:06" (1/3) ... [2025-01-09 16:10:11,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbb953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:10:11, skipping insertion in model container [2025-01-09 16:10:11,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:07" (2/3) ... [2025-01-09 16:10:11,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbb953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:10:11, skipping insertion in model container [2025-01-09 16:10:11,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:10:11" (3/3) ... [2025-01-09 16:10:11,804 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-33.i [2025-01-09 16:10:11,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:10:11,814 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-33.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:10:11,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:10:11,864 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;@42543924, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:10:11,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:10:11,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 73 states have internal predecessors, (102), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:10:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 16:10:11,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:10:11,875 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:10:11,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:10:11,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:10:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1456415744, now seen corresponding path program 1 times [2025-01-09 16:10:11,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:10:11,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163681338] [2025-01-09 16:10:11,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:10:11,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:10:11,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:10:11,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:10:11,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 16:10:12,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 16:10:12,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 16:10:12,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:10:12,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:10:12,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:10:12,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:10:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-09 16:10:12,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:10:12,193 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:10:12,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163681338] [2025-01-09 16:10:12,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163681338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:10:12,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:10:12,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:10:12,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677797596] [2025-01-09 16:10:12,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:10:12,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:10:12,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:10:12,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:10:12,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:10:12,212 INFO L87 Difference]: Start difference. First operand has 84 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 73 states have internal predecessors, (102), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:10:12,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:10:12,228 INFO L93 Difference]: Finished difference Result 162 states and 244 transitions. [2025-01-09 16:10:12,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:10:12,229 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2025-01-09 16:10:12,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:10:12,233 INFO L225 Difference]: With dead ends: 162 [2025-01-09 16:10:12,234 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 16:10:12,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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 16:10:12,238 INFO L435 NwaCegarLoop]: 115 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, 115 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 16:10:12,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:10:12,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 16:10:12,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 16:10:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:10:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-01-09 16:10:12,270 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 92 [2025-01-09 16:10:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:10:12,271 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-01-09 16:10:12,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:10:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-01-09 16:10:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 16:10:12,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:10:12,276 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:10:12,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 16:10:12,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:10:12,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:10:12,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:10:12,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1033856002, now seen corresponding path program 1 times [2025-01-09 16:10:12,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:10:12,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989484495] [2025-01-09 16:10:12,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:10:12,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:10:12,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:10:12,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:10:12,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 16:10:12,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 16:10:12,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 16:10:12,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:10:12,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:10:12,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:10:12,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:10:12,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 16:10:12,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-01-09 16:10:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:10:12,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:10:12,867 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:10:12,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989484495] [2025-01-09 16:10:12,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989484495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:10:12,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:10:12,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:10:12,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730221547] [2025-01-09 16:10:12,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:10:12,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:10:12,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:10:12,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:10:12,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:10:12,869 INFO L87 Difference]: Start difference. First operand 81 states and 115 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:10:15,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:10:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:10:20,467 INFO L93 Difference]: Finished difference Result 195 states and 277 transitions. [2025-01-09 16:10:20,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:10:20,468 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-01-09 16:10:20,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:10:20,473 INFO L225 Difference]: With dead ends: 195 [2025-01-09 16:10:20,473 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 16:10:20,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:10:20,474 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 44 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:10:20,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 336 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2025-01-09 16:10:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 16:10:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 87. [2025-01-09 16:10:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:10:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2025-01-09 16:10:20,487 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 92 [2025-01-09 16:10:20,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:10:20,488 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2025-01-09 16:10:20,488 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:10:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2025-01-09 16:10:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 16:10:20,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:10:20,489 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:10:20,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 16:10:20,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:10:20,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:10:20,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:10:20,695 INFO L85 PathProgramCache]: Analyzing trace with hash -246007676, now seen corresponding path program 1 times [2025-01-09 16:10:20,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:10:20,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642609064] [2025-01-09 16:10:20,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:10:20,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:10:20,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:10:20,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:10:20,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 16:10:20,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 16:10:20,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 16:10:20,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:10:20,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:10:20,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:10:20,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:10:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:10:20,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:10:20,967 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:10:20,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642609064] [2025-01-09 16:10:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642609064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:10:20,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:10:20,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:10:20,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825167109] [2025-01-09 16:10:20,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:10:20,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:10:20,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:10:20,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:10:20,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:10:20,968 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:10:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:10:21,023 INFO L93 Difference]: Finished difference Result 178 states and 253 transitions. [2025-01-09 16:10:21,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:10:21,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-01-09 16:10:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:10:21,024 INFO L225 Difference]: With dead ends: 178 [2025-01-09 16:10:21,024 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 16:10:21,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:10:21,025 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:10:21,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 519 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:10:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 16:10:21,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-01-09 16:10:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:10:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2025-01-09 16:10:21,042 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 92 [2025-01-09 16:10:21,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:10:21,042 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2025-01-09 16:10:21,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:10:21,043 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2025-01-09 16:10:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 16:10:21,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:10:21,044 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:10:21,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 16:10:21,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:10:21,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:10:21,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:10:21,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1528999686, now seen corresponding path program 1 times [2025-01-09 16:10:21,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:10:21,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931999759] [2025-01-09 16:10:21,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:10:21,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:10:21,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:10:21,250 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:10:21,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 16:10:21,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 16:10:21,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 16:10:21,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:10:21,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:10:21,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:10:21,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:10:21,478 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 16:10:21,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:10:21,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:10:21,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931999759] [2025-01-09 16:10:21,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931999759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:10:21,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:10:21,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:10:21,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021782028] [2025-01-09 16:10:21,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:10:21,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:10:21,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:10:21,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:10:21,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:10:21,480 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:10:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:10:21,535 INFO L93 Difference]: Finished difference Result 186 states and 259 transitions. [2025-01-09 16:10:21,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:10:21,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-01-09 16:10:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:10:21,536 INFO L225 Difference]: With dead ends: 186 [2025-01-09 16:10:21,536 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 16:10:21,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:10:21,537 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:10:21,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 616 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:10:21,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 16:10:21,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-01-09 16:10:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:10:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2025-01-09 16:10:21,542 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 92 [2025-01-09 16:10:21,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:10:21,542 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2025-01-09 16:10:21,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 16:10:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2025-01-09 16:10:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 16:10:21,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:10:21,543 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:10:21,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 16:10:21,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:10:21,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:10:21,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:10:21,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1530846728, now seen corresponding path program 1 times [2025-01-09 16:10:21,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:10:21,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810031519] [2025-01-09 16:10:21,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:10:21,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:10:21,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:10:21,753 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:10:21,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 16:10:21,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 16:10:21,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 16:10:21,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:10:21,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:10:21,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:10:21,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:10:22,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-01-09 16:10:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 16:10:22,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:10:22,155 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:10:22,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810031519] [2025-01-09 16:10:22,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810031519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:10:22,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:10:22,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:10:22,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260472966] [2025-01-09 16:10:22,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:10:22,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:10:22,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:10:22,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:10:22,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:10:22,156 INFO L87 Difference]: Start difference. First operand 95 states and 131 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:10:26,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:10:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:10:26,332 INFO L93 Difference]: Finished difference Result 188 states and 260 transitions. [2025-01-09 16:10:26,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:10:26,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2025-01-09 16:10:26,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:10:26,333 INFO L225 Difference]: With dead ends: 188 [2025-01-09 16:10:26,333 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 16:10:26,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:10:26,334 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 88 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:10:26,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 329 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 16:10:26,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 16:10:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-01-09 16:10:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 84 states have internal predecessors, (112), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:10:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 130 transitions. [2025-01-09 16:10:26,339 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 130 transitions. Word has length 92 [2025-01-09 16:10:26,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:10:26,339 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 130 transitions. [2025-01-09 16:10:26,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:10:26,340 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 130 transitions. [2025-01-09 16:10:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 16:10:26,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:10:26,341 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:10:26,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-01-09 16:10:26,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:10:26,545 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:10:26,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:10:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash 281257700, now seen corresponding path program 1 times [2025-01-09 16:10:26,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:10:26,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739156688] [2025-01-09 16:10:26,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:10:26,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:10:26,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:10:26,549 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:10:26,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 16:10:26,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 16:10:26,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 16:10:26,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:10:26,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:10:26,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:10:26,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:10:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 16:10:26,797 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:10:26,797 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:10:26,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739156688] [2025-01-09 16:10:26,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739156688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:10:26,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:10:26,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:10:26,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737211709] [2025-01-09 16:10:26,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:10:26,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:10:26,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:10:26,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:10:26,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:10:26,798 INFO L87 Difference]: Start difference. First operand 95 states and 130 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 16:10:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:10:26,893 INFO L93 Difference]: Finished difference Result 191 states and 262 transitions. [2025-01-09 16:10:26,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:10:26,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 94 [2025-01-09 16:10:26,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:10:26,895 INFO L225 Difference]: With dead ends: 191 [2025-01-09 16:10:26,895 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 16:10:26,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:10:26,896 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:10:26,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 483 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:10:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 16:10:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2025-01-09 16:10:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 84 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:10:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2025-01-09 16:10:26,908 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 94 [2025-01-09 16:10:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:10:26,908 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2025-01-09 16:10:26,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 16:10:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2025-01-09 16:10:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 16:10:26,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:10:26,910 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:10:26,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-01-09 16:10:27,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:10:27,111 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:10:27,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:10:27,112 INFO L85 PathProgramCache]: Analyzing trace with hash -162642974, now seen corresponding path program 1 times [2025-01-09 16:10:27,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:10:27,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253167127] [2025-01-09 16:10:27,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:10:27,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:10:27,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:10:27,114 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:10:27,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 16:10:27,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 16:10:27,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 16:10:27,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:10:27,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:10:27,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:10:27,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:10:27,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-01-09 16:10:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 16:10:27,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:10:27,438 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:10:27,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253167127] [2025-01-09 16:10:27,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253167127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:10:27,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:10:27,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:10:27,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811193976] [2025-01-09 16:10:27,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:10:27,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:10:27,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:10:27,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:10:27,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:10:27,439 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:10:30,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:10:32,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:10:32,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:10:32,180 INFO L93 Difference]: Finished difference Result 188 states and 256 transitions. [2025-01-09 16:10:32,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:10:32,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2025-01-09 16:10:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:10:32,181 INFO L225 Difference]: With dead ends: 188 [2025-01-09 16:10:32,182 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 16:10:32,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:10:32,182 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 79 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 16:10:32,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 321 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-01-09 16:10:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 16:10:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-01-09 16:10:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 16:10:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 128 transitions. [2025-01-09 16:10:32,187 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 128 transitions. Word has length 94 [2025-01-09 16:10:32,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:10:32,187 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 128 transitions. [2025-01-09 16:10:32,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 16:10:32,188 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 128 transitions. [2025-01-09 16:10:32,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 16:10:32,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:10:32,188 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:10:32,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 16:10:32,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:10:32,389 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:10:32,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:10:32,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1025580088, now seen corresponding path program 1 times [2025-01-09 16:10:32,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:10:32,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673121312] [2025-01-09 16:10:32,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:10:32,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:10:32,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:10:32,392 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:10:32,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-01-09 16:10:32,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 16:10:32,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 16:10:32,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:10:32,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:10:32,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 16:10:32,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:10:32,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 11 [2025-01-09 16:10:32,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-01-09 16:10:33,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2025-01-09 16:10:33,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2025-01-09 16:10:34,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2025-01-09 16:10:34,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2025-01-09 16:10:34,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:10:34,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 54 [2025-01-09 16:10:35,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:10:35,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 22 [2025-01-09 16:10:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 26 proven. 74 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 16:10:35,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:10:51,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:10:51,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673121312] [2025-01-09 16:10:51,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673121312] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:10:51,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1411864373] [2025-01-09 16:10:51,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:10:51,377 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 16:10:51,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 16:10:51,403 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 16:10:51,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-01-09 16:10:51,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 16:10:52,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 16:10:52,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:10:52,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:10:52,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 16:10:52,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:10:53,856 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2025-01-09 16:10:53,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 16:10:53,985 INFO L349 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2025-01-09 16:10:53,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 52 [2025-01-09 16:10:54,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 127