./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:49:20,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:49:20,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:49:20,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:49:20,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:49:20,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:49:20,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:49:20,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:49:20,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:49:20,634 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:49:20,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:49:20,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:49:20,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:49:20,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:49:20,635 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:49:20,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:49:20,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:49:20,635 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:49:20,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:49:20,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:49:20,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:49:20,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:49:20,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:49:20,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:49:20,636 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:49:20,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:49:20,636 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:49:20,636 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:49:20,636 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:49:20,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:49:20,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:49:20,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:49:20,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:49:20,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:49:20,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:49:20,637 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:49:20,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:49:20,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:49:20,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:49:20,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:49:20,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:49:20,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:49:20,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:49:20,638 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/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 -> 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e [2025-03-04 01:49:20,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:49:20,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:49:20,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:49:20,855 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:49:20,855 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:49:20,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i [2025-03-04 01:49:21,948 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa624ca31/5ad5ff1a290c4f77ab0e0681eb2b72d4/FLAG6c8b5fdf3 [2025-03-04 01:49:22,182 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:49:22,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i [2025-03-04 01:49:22,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa624ca31/5ad5ff1a290c4f77ab0e0681eb2b72d4/FLAG6c8b5fdf3 [2025-03-04 01:49:22,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa624ca31/5ad5ff1a290c4f77ab0e0681eb2b72d4 [2025-03-04 01:49:22,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:49:22,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:49:22,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:49:22,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:49:22,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:49:22,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:49:22" (1/1) ... [2025-03-04 01:49:22,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30326cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:22, skipping insertion in model container [2025-03-04 01:49:22,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:49:22" (1/1) ... [2025-03-04 01:49:22,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:49:22,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i[917,930] [2025-03-04 01:49:22,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:49:22,417 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:49:22,427 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i[917,930] [2025-03-04 01:49:22,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:49:22,469 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:49:22,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:22 WrapperNode [2025-03-04 01:49:22,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:49:22,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:49:22,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:49:22,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:49:22,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:22" (1/1) ... [2025-03-04 01:49:22,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:22" (1/1) ... [2025-03-04 01:49:22,512 INFO L138 Inliner]: procedures = 30, calls = 133, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2025-03-04 01:49:22,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:49:22,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:49:22,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:49:22,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:49:22,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:22" (1/1) ... [2025-03-04 01:49:22,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:22" (1/1) ... [2025-03-04 01:49:22,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:22" (1/1) ... [2025-03-04 01:49:22,527 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:49:22,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:22" (1/1) ... [2025-03-04 01:49:22,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:22" (1/1) ... [2025-03-04 01:49:22,535 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:22" (1/1) ... [2025-03-04 01:49:22,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:22" (1/1) ... [2025-03-04 01:49:22,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:22" (1/1) ... [2025-03-04 01:49:22,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:22" (1/1) ... [2025-03-04 01:49:22,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:49:22,548 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:49:22,548 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:49:22,548 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:49:22,550 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:22" (1/1) ... [2025-03-04 01:49:22,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:49:22,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:49:22,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:49:22,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:49:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:49:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:49:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:49:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:49:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:49:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:49:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:49:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:49:22,606 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:49:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:49:22,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:49:22,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:49:22,703 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:49:22,704 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:49:23,018 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~mem59#1;havoc property_#t~ite71#1;havoc property_#t~mem63#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short81#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite91#1;havoc property_#t~ite88#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short110#1; [2025-03-04 01:49:23,054 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-04 01:49:23,054 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:49:23,063 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:49:23,064 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:49:23,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:49:23 BoogieIcfgContainer [2025-03-04 01:49:23,064 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:49:23,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:49:23,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:49:23,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:49:23,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:49:22" (1/3) ... [2025-03-04 01:49:23,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc54f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:49:23, skipping insertion in model container [2025-03-04 01:49:23,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:22" (2/3) ... [2025-03-04 01:49:23,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc54f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:49:23, skipping insertion in model container [2025-03-04 01:49:23,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:49:23" (3/3) ... [2025-03-04 01:49:23,070 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-31.i [2025-03-04 01:49:23,080 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:49:23,081 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-31.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:49:23,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:49:23,128 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;@95c6f15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:49:23,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:49:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:49:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 01:49:23,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:23,141 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:23,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:23,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:23,145 INFO L85 PathProgramCache]: Analyzing trace with hash 9201494, now seen corresponding path program 1 times [2025-03-04 01:49:23,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:23,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776722379] [2025-03-04 01:49:23,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:23,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:49:23,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:49:23,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:23,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:49:23,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:23,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776722379] [2025-03-04 01:49:23,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776722379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:49:23,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054308445] [2025-03-04 01:49:23,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:23,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:49:23,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:49:23,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:49:23,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:49:23,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:49:23,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:49:23,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:23,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:23,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:49:23,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:49:23,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:23,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054308445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:23,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:49:23,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:49:23,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767688639] [2025-03-04 01:49:23,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:23,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:49:23,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:23,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:49:23,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:49:23,650 INFO L87 Difference]: Start difference. First operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:49:23,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:23,668 INFO L93 Difference]: Finished difference Result 166 states and 258 transitions. [2025-03-04 01:49:23,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:49:23,670 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-03-04 01:49:23,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:23,674 INFO L225 Difference]: With dead ends: 166 [2025-03-04 01:49:23,674 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 01:49:23,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-03-04 01:49:23,678 INFO L435 NwaCegarLoop]: 121 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, 121 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-03-04 01:49:23,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:49:23,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 01:49:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 01:49:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:49:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2025-03-04 01:49:23,707 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 94 [2025-03-04 01:49:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:23,707 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2025-03-04 01:49:23,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:49:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2025-03-04 01:49:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 01:49:23,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:23,710 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:23,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:49:23,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:49:23,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:23,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:23,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1363789697, now seen corresponding path program 1 times [2025-03-04 01:49:23,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:23,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045506456] [2025-03-04 01:49:23,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:23,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:23,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:49:24,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:49:24,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:24,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:49:24,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:24,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045506456] [2025-03-04 01:49:24,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045506456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:24,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:24,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:49:24,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395017444] [2025-03-04 01:49:24,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:24,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:49:24,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:24,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:49:24,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:49:24,338 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:24,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:24,357 INFO L93 Difference]: Finished difference Result 163 states and 239 transitions. [2025-03-04 01:49:24,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:49:24,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-03-04 01:49:24,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:24,360 INFO L225 Difference]: With dead ends: 163 [2025-03-04 01:49:24,361 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 01:49:24,361 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-03-04 01:49:24,362 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:24,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:49:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 01:49:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 01:49:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:49:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2025-03-04 01:49:24,371 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 94 [2025-03-04 01:49:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:24,372 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2025-03-04 01:49:24,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2025-03-04 01:49:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 01:49:24,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:24,375 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:24,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:49:24,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:24,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:24,378 INFO L85 PathProgramCache]: Analyzing trace with hash -10480000, now seen corresponding path program 1 times [2025-03-04 01:49:24,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:24,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842754877] [2025-03-04 01:49:24,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:24,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:24,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:49:24,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:49:24,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:24,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:49:25,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:25,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842754877] [2025-03-04 01:49:25,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842754877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:25,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:25,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:49:25,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844282923] [2025-03-04 01:49:25,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:25,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:49:25,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:25,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:49:25,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:49:25,721 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:49:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:26,215 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2025-03-04 01:49:26,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:49:26,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-03-04 01:49:26,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:26,217 INFO L225 Difference]: With dead ends: 199 [2025-03-04 01:49:26,217 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 01:49:26,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:49:26,218 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 307 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:26,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 290 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:49:26,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 01:49:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 87. [2025-03-04 01:49:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:49:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2025-03-04 01:49:26,227 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 94 [2025-03-04 01:49:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:26,227 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2025-03-04 01:49:26,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:49:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2025-03-04 01:49:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:49:26,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:26,229 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:26,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:49:26,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:26,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:26,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1777596354, now seen corresponding path program 1 times [2025-03-04 01:49:26,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:26,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961052351] [2025-03-04 01:49:26,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:26,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:26,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:49:26,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:49:26,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:26,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:49:26,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:26,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961052351] [2025-03-04 01:49:26,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961052351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:26,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:26,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:49:26,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790045102] [2025-03-04 01:49:26,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:26,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:49:26,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:26,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:49:26,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:49:26,403 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:26,416 INFO L93 Difference]: Finished difference Result 171 states and 247 transitions. [2025-03-04 01:49:26,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:49:26,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-03-04 01:49:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:26,417 INFO L225 Difference]: With dead ends: 171 [2025-03-04 01:49:26,417 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 01:49:26,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:49:26,418 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:26,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:49:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 01:49:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-04 01:49:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 74 states have internal predecessors, (102), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:49:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2025-03-04 01:49:26,426 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 96 [2025-03-04 01:49:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:26,426 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2025-03-04 01:49:26,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2025-03-04 01:49:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:49:26,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:26,430 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:26,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:49:26,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:26,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:26,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1974109859, now seen corresponding path program 1 times [2025-03-04 01:49:26,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:26,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135071170] [2025-03-04 01:49:26,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:26,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:26,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:49:26,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:49:26,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:26,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:49:28,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:28,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135071170] [2025-03-04 01:49:28,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135071170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:28,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:28,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:49:28,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640186527] [2025-03-04 01:49:28,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:28,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:49:28,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:28,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:49:28,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:49:28,759 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:49:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:29,784 INFO L93 Difference]: Finished difference Result 175 states and 250 transitions. [2025-03-04 01:49:29,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:49:29,784 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2025-03-04 01:49:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:29,785 INFO L225 Difference]: With dead ends: 175 [2025-03-04 01:49:29,785 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 01:49:29,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:49:29,786 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 209 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:29,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 563 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:49:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 01:49:29,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-03-04 01:49:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.368421052631579) internal successors, (104), 76 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:49:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2025-03-04 01:49:29,802 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 96 [2025-03-04 01:49:29,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:29,803 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2025-03-04 01:49:29,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:49:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2025-03-04 01:49:29,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:49:29,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:29,807 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:29,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:49:29,807 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:29,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:29,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1608138819, now seen corresponding path program 1 times [2025-03-04 01:49:29,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:29,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996327912] [2025-03-04 01:49:29,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:29,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:49:29,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:49:29,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:29,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:49:30,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:30,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996327912] [2025-03-04 01:49:30,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996327912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:30,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:30,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:49:30,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017388224] [2025-03-04 01:49:30,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:30,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:49:30,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:30,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:49:30,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:49:30,912 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:49:31,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:31,357 INFO L93 Difference]: Finished difference Result 209 states and 295 transitions. [2025-03-04 01:49:31,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:49:31,358 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2025-03-04 01:49:31,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:31,359 INFO L225 Difference]: With dead ends: 209 [2025-03-04 01:49:31,359 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 01:49:31,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:49:31,360 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 380 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:31,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 342 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:49:31,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 01:49:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2025-03-04 01:49:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:49:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2025-03-04 01:49:31,373 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 96 [2025-03-04 01:49:31,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:31,374 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2025-03-04 01:49:31,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:49:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2025-03-04 01:49:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 01:49:31,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:31,375 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:31,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:49:31,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:31,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:31,375 INFO L85 PathProgramCache]: Analyzing trace with hash 632648379, now seen corresponding path program 1 times [2025-03-04 01:49:31,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:31,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14746209] [2025-03-04 01:49:31,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:31,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:31,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 01:49:31,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 01:49:31,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:31,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:49:31,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:31,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14746209] [2025-03-04 01:49:31,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14746209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:49:31,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954813488] [2025-03-04 01:49:31,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:31,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:49:31,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:49:31,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:49:31,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:49:31,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 01:49:31,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 01:49:31,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:31,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:31,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:49:31,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:49:31,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:31,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954813488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:31,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:49:31,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:49:31,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45634240] [2025-03-04 01:49:31,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:31,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:49:31,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:31,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:49:31,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:49:31,679 INFO L87 Difference]: Start difference. First operand 89 states and 125 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:31,702 INFO L93 Difference]: Finished difference Result 178 states and 251 transitions. [2025-03-04 01:49:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:49:31,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2025-03-04 01:49:31,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:31,703 INFO L225 Difference]: With dead ends: 178 [2025-03-04 01:49:31,703 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 01:49:31,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:49:31,704 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 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-03-04 01:49:31,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:49:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 01:49:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2025-03-04 01:49:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:49:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2025-03-04 01:49:31,712 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 97 [2025-03-04 01:49:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:31,713 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2025-03-04 01:49:31,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2025-03-04 01:49:31,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 01:49:31,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:31,714 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:31,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:49:31,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 01:49:31,914 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:31,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:31,915 INFO L85 PathProgramCache]: Analyzing trace with hash 503565660, now seen corresponding path program 1 times [2025-03-04 01:49:31,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:31,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824949650] [2025-03-04 01:49:31,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:31,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:31,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 01:49:31,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 01:49:31,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:31,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:49:32,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:32,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824949650] [2025-03-04 01:49:32,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824949650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:32,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:32,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:49:32,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235846803] [2025-03-04 01:49:32,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:32,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:49:32,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:32,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:49:32,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:49:32,100 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:32,302 INFO L93 Difference]: Finished difference Result 206 states and 286 transitions. [2025-03-04 01:49:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:49:32,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2025-03-04 01:49:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:32,303 INFO L225 Difference]: With dead ends: 206 [2025-03-04 01:49:32,304 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 01:49:32,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:49:32,304 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 156 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:32,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 299 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:49:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 01:49:32,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2025-03-04 01:49:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:49:32,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2025-03-04 01:49:32,313 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 97 [2025-03-04 01:49:32,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:32,313 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2025-03-04 01:49:32,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:32,313 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2025-03-04 01:49:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 01:49:32,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:32,314 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:32,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:49:32,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:32,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:32,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2016782165, now seen corresponding path program 1 times [2025-03-04 01:49:32,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:32,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132062015] [2025-03-04 01:49:32,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:32,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:32,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 01:49:32,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 01:49:32,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:32,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:49:33,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:33,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132062015] [2025-03-04 01:49:33,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132062015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:33,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:33,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:49:33,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350033993] [2025-03-04 01:49:33,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:33,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:49:33,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:33,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:49:33,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:49:33,417 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:49:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:34,002 INFO L93 Difference]: Finished difference Result 232 states and 322 transitions. [2025-03-04 01:49:34,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:49:34,002 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2025-03-04 01:49:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:34,003 INFO L225 Difference]: With dead ends: 232 [2025-03-04 01:49:34,003 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 01:49:34,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:49:34,004 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 346 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:34,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 447 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:49:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 01:49:34,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 123. [2025-03-04 01:49:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 110 states have (on average 1.3454545454545455) internal successors, (148), 110 states have internal predecessors, (148), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:49:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 170 transitions. [2025-03-04 01:49:34,021 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 170 transitions. Word has length 98 [2025-03-04 01:49:34,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:34,022 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 170 transitions. [2025-03-04 01:49:34,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:49:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 170 transitions. [2025-03-04 01:49:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:49:34,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:34,022 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:34,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:49:34,023 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:34,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:34,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1761835691, now seen corresponding path program 1 times [2025-03-04 01:49:34,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:34,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061137725] [2025-03-04 01:49:34,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:34,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:34,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:49:34,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:49:34,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:34,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:49:34,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [280343784] [2025-03-04 01:49:34,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:34,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:49:34,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:49:34,112 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:49:34,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:49:34,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:49:34,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:49:34,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:34,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:34,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-04 01:49:34,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:34,355 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 41 treesize of output 40 [2025-03-04 01:49:34,509 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 64 treesize of output 50 [2025-03-04 01:49:34,839 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 15 treesize of output 1 [2025-03-04 01:49:35,263 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 23 treesize of output 11 [2025-03-04 01:49:35,565 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 23 treesize of output 11 [2025-03-04 01:49:35,873 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 23 treesize of output 11 [2025-03-04 01:49:36,145 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 23 treesize of output 11 [2025-03-04 01:49:36,507 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 36 treesize of output 23 [2025-03-04 01:49:36,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:49:36,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:49:36,570 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 36 treesize of output 23 [2025-03-04 01:49:36,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:49:36,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:49:36,627 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 36 treesize of output 23 [2025-03-04 01:49:36,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2025-03-04 01:49:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 69 proven. 61 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-04 01:49:36,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:49:41,218 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_934 (Array Int Int)) (|v_ULTIMATE.start_property_#t~mem82#1_11| Int) (v_ArrVal_936 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_934))) (store .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_936))))) (or (< (* c_~last_1_WrapperStruct00_var_1_7~0 |v_ULTIMATE.start_property_#t~mem82#1_11|) (+ 1 (select (select .cse0 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset))) (not (= v_ArrVal_934 (store (select |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_934 c_~WrapperStruct00_var_1_13_Pointer~0.offset)))) (< (select (select .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset) |v_ULTIMATE.start_property_#t~mem82#1_11|)))) is different from false [2025-03-04 01:49:41,244 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_934 (Array Int Int)) (|v_ULTIMATE.start_property_#t~mem82#1_11| Int) (v_ArrVal_936 Int) (v_ArrVal_932 Int)) (let ((.cse1 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_932)))) (let ((.cse0 (let ((.cse2 (store .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_934))) (store .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_936))))) (or (< (select (select .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset) |v_ULTIMATE.start_property_#t~mem82#1_11|) (not (= v_ArrVal_934 (store (select .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_934 c_~WrapperStruct00_var_1_13_Pointer~0.offset)))) (< (* c_~last_1_WrapperStruct00_var_1_7~0 |v_ULTIMATE.start_property_#t~mem82#1_11|) (+ (select (select .cse0 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) 1)))))) is different from false [2025-03-04 01:49:41,381 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_step_#t~mem4#1_10| Int)) (or (< |v_ULTIMATE.start_step_#t~mem4#1_10| (select (select |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (< (select (select |c_#memory_int| c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) (* c_~last_1_WrapperStruct00_var_1_7~0 |v_ULTIMATE.start_step_#t~mem4#1_10|)))) (forall ((v_ArrVal_934 (Array Int Int)) (|v_ULTIMATE.start_property_#t~mem82#1_11| Int) (v_ArrVal_936 Int) (v_ArrVal_932 Int)) (let ((.cse1 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_932)))) (let ((.cse0 (let ((.cse2 (store .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_934))) (store .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_936))))) (or (< (select (select .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset) |v_ULTIMATE.start_property_#t~mem82#1_11|) (not (= v_ArrVal_934 (store (select .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_934 c_~WrapperStruct00_var_1_13_Pointer~0.offset)))) (< (* c_~last_1_WrapperStruct00_var_1_7~0 |v_ULTIMATE.start_property_#t~mem82#1_11|) (+ (select (select .cse0 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) 1))))))) is different from false [2025-03-04 01:49:41,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:41,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061137725] [2025-03-04 01:49:41,457 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:49:41,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280343784] [2025-03-04 01:49:41,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280343784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:49:41,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:49:41,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-03-04 01:49:41,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687045908] [2025-03-04 01:49:41,457 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 01:49:41,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:49:41,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:41,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:49:41,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=286, Unknown=3, NotChecked=108, Total=462 [2025-03-04 01:49:41,458 INFO L87 Difference]: Start difference. First operand 123 states and 170 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-04 01:49:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:42,632 INFO L93 Difference]: Finished difference Result 397 states and 543 transitions. [2025-03-04 01:49:42,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:49:42,632 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 99 [2025-03-04 01:49:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:42,634 INFO L225 Difference]: With dead ends: 397 [2025-03-04 01:49:42,634 INFO L226 Difference]: Without dead ends: 277 [2025-03-04 01:49:42,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=190, Invalid=689, Unknown=3, NotChecked=174, Total=1056 [2025-03-04 01:49:42,635 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 227 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:42,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 800 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:49:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-04 01:49:42,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 198. [2025-03-04 01:49:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.3216374269005848) internal successors, (226), 171 states have internal predecessors, (226), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:49:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 270 transitions. [2025-03-04 01:49:42,657 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 270 transitions. Word has length 99 [2025-03-04 01:49:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:42,657 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 270 transitions. [2025-03-04 01:49:42,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-04 01:49:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 270 transitions. [2025-03-04 01:49:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:49:42,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:42,658 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:42,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:49:42,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:49:42,859 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:42,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:42,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1178970297, now seen corresponding path program 1 times [2025-03-04 01:49:42,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:42,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718619180] [2025-03-04 01:49:42,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:42,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:42,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:49:42,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:49:42,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:42,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:49:43,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:43,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718619180] [2025-03-04 01:49:43,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718619180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:43,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:43,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:49:43,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175240222] [2025-03-04 01:49:43,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:43,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:49:43,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:43,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:49:43,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:49:43,049 INFO L87 Difference]: Start difference. First operand 198 states and 270 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:43,304 INFO L93 Difference]: Finished difference Result 397 states and 535 transitions. [2025-03-04 01:49:43,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:49:43,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-04 01:49:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:43,306 INFO L225 Difference]: With dead ends: 397 [2025-03-04 01:49:43,306 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 01:49:43,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:49:43,307 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 127 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:43,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 541 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:49:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 01:49:43,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 210. [2025-03-04 01:49:43,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 183 states have (on average 1.3333333333333333) internal successors, (244), 183 states have internal predecessors, (244), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:49:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 288 transitions. [2025-03-04 01:49:43,333 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 288 transitions. Word has length 99 [2025-03-04 01:49:43,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:43,333 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 288 transitions. [2025-03-04 01:49:43,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 288 transitions. [2025-03-04 01:49:43,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:49:43,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:43,334 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:43,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:49:43,334 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:43,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:43,335 INFO L85 PathProgramCache]: Analyzing trace with hash 668436120, now seen corresponding path program 1 times [2025-03-04 01:49:43,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:43,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932839878] [2025-03-04 01:49:43,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:43,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:49:43,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:49:43,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:43,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:49:43,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:43,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932839878] [2025-03-04 01:49:43,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932839878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:43,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:43,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:49:43,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058984577] [2025-03-04 01:49:43,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:43,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:49:43,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:43,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:49:43,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:49:43,470 INFO L87 Difference]: Start difference. First operand 210 states and 288 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:43,609 INFO L93 Difference]: Finished difference Result 421 states and 576 transitions. [2025-03-04 01:49:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:49:43,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-04 01:49:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:43,611 INFO L225 Difference]: With dead ends: 421 [2025-03-04 01:49:43,611 INFO L226 Difference]: Without dead ends: 280 [2025-03-04 01:49:43,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:49:43,612 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 84 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:43,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 341 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:49:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-04 01:49:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 225. [2025-03-04 01:49:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 198 states have (on average 1.3383838383838385) internal successors, (265), 198 states have internal predecessors, (265), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:49:43,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 309 transitions. [2025-03-04 01:49:43,635 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 309 transitions. Word has length 99 [2025-03-04 01:49:43,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:43,635 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 309 transitions. [2025-03-04 01:49:43,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 309 transitions. [2025-03-04 01:49:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:49:43,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:43,636 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:43,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:49:43,636 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:43,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:43,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2021745817, now seen corresponding path program 1 times [2025-03-04 01:49:43,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:43,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086360818] [2025-03-04 01:49:43,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:43,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:43,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:49:43,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:49:43,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:43,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:49:43,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:49:43,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086360818] [2025-03-04 01:49:43,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086360818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:43,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:43,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:49:43,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634496682] [2025-03-04 01:49:43,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:43,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:49:43,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:49:43,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:49:43,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:49:43,760 INFO L87 Difference]: Start difference. First operand 225 states and 309 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:43,882 INFO L93 Difference]: Finished difference Result 414 states and 556 transitions. [2025-03-04 01:49:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:49:43,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-04 01:49:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:43,884 INFO L225 Difference]: With dead ends: 414 [2025-03-04 01:49:43,884 INFO L226 Difference]: Without dead ends: 262 [2025-03-04 01:49:43,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:49:43,886 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 84 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:43,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 336 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:49:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-04 01:49:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 207. [2025-03-04 01:49:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 180 states have (on average 1.3055555555555556) internal successors, (235), 180 states have internal predecessors, (235), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:49:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 279 transitions. [2025-03-04 01:49:43,912 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 279 transitions. Word has length 99 [2025-03-04 01:49:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:43,913 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 279 transitions. [2025-03-04 01:49:43,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 279 transitions. [2025-03-04 01:49:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:49:43,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:43,914 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:43,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:49:43,914 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:43,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:43,914 INFO L85 PathProgramCache]: Analyzing trace with hash 528673194, now seen corresponding path program 1 times [2025-03-04 01:49:43,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:49:43,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071658738] [2025-03-04 01:49:43,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:43,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:49:43,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:49:44,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:49:44,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:44,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:49:44,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1802267893] [2025-03-04 01:49:44,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:44,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:49:44,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:49:44,014 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:49:44,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:49:44,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:49:44,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:49:44,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:44,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:49:44,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:49:44,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:49:44,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:49:44,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:44,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:49:44,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:49:44,645 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:49:44,646 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:49:44,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:49:44,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:49:44,850 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:49:44,941 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:49:44,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:49:44 BoogieIcfgContainer [2025-03-04 01:49:44,944 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:49:44,945 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:49:44,945 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:49:44,945 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:49:44,945 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:49:23" (3/4) ... [2025-03-04 01:49:44,947 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:49:44,948 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:49:44,948 INFO L158 Benchmark]: Toolchain (without parser) took 22732.60ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 133.1MB in the beginning and 431.8MB in the end (delta: -298.6MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2025-03-04 01:49:44,948 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:49:44,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.58ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 118.3MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:49:44,949 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.59ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 115.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:49:44,949 INFO L158 Benchmark]: Boogie Preprocessor took 31.94ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 112.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:49:44,949 INFO L158 Benchmark]: IcfgBuilder took 516.58ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 83.4MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:49:44,949 INFO L158 Benchmark]: TraceAbstraction took 21878.90ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 83.0MB in the beginning and 431.9MB in the end (delta: -348.9MB). Peak memory consumption was 233.1MB. Max. memory is 16.1GB. [2025-03-04 01:49:44,949 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 486.5MB. Free memory was 431.9MB in the beginning and 431.8MB in the end (delta: 152.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:49:44,950 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.18ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.58ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 118.3MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.59ms. Allocated memory is still 167.8MB. Free memory was 118.3MB in the beginning and 115.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.94ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 112.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 516.58ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 83.4MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21878.90ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 83.0MB in the beginning and 431.9MB in the end (delta: -348.9MB). Peak memory consumption was 233.1MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 486.5MB. Free memory was 431.9MB in the beginning and 431.8MB in the end (delta: 152.4kB). Peak memory consumption was 8.4MB. 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 someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 121. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 200, 0, 1107940323, 0, 4, -32, 64, 4, 0.97, 32.6 }; [L47] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L49] signed long int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L50] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L51] signed long int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L52] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L53] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L54] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L55] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L56] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L57] signed long int last_1_WrapperStruct00_var_1_7 = 4; [L58] double last_1_WrapperStruct00_var_1_13 = 0.97; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=0, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L117] EXPR WrapperStruct00.var_1_7 [L117] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_13 [L118] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L98] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L100] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L101] WrapperStruct00.var_1_3 = __VERIFIER_nondet_long() [L102] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L103] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L104] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L106] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L107] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L108] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L109] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L110] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L112] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L113] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L114] EXPR WrapperStruct00.var_1_14 [L114] EXPR WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_14 [L114] EXPR WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L114] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L129] RET updateVariables() [L130] CALL step() [L62] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L62] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L62] COND FALSE !(! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) [L69] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L69] (*(WrapperStruct00_var_1_9_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L71] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) [L74] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L74] (*(WrapperStruct00_var_1_7_Pointer)) = ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) [L76] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L76] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L76] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L76] COND FALSE !(((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) [L87] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L87] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L89] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) [L90] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L90] (*(WrapperStruct00_var_1_1_Pointer)) = (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer)))))) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR ((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L121] EXPR (! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))))) && ((((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L121] EXPR (((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))))) && ((((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121-L122] return ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))))) && ((((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.7s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1925 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1920 mSDsluCounter, 5001 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3613 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3605 IncrementalHoareTripleChecker+Invalid, 3719 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 1388 mSDtfsCounter, 3605 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 335 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=12, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 374 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 1748 NumberOfCodeBlocks, 1748 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1434 ConstructedInterpolants, 0 QuantifiedInterpolants, 13360 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1245 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 3189/3300 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-03-04 01:49:44,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:49:46,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:49:46,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:49:46,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:49:46,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:49:46,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:49:46,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:49:46,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:49:46,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:49:46,876 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:49:46,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:49:46,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:49:46,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:49:46,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:49:46,877 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:49:46,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:49:46,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:49:46,877 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:49:46,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:49:46,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:49:46,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:49:46,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:49:46,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:49:46,878 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:49:46,878 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:49:46,878 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:49:46,878 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:49:46,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:49:46,878 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:49:46,878 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:49:46,878 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:49:46,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:49:46,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:49:46,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:49:46,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:49:46,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:49:46,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:49:46,879 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:49:46,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:49:46,879 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:49:46,879 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:49:46,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:49:46,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:49:46,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:49:46,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:49:46,879 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/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 -> 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e [2025-03-04 01:49:47,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:49:47,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:49:47,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:49:47,121 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:49:47,121 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:49:47,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i [2025-03-04 01:49:48,270 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20819739b/6e6930ce984a4dc9bf7160286654b6d9/FLAG75c308985 [2025-03-04 01:49:48,451 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:49:48,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i [2025-03-04 01:49:48,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20819739b/6e6930ce984a4dc9bf7160286654b6d9/FLAG75c308985 [2025-03-04 01:49:48,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20819739b/6e6930ce984a4dc9bf7160286654b6d9 [2025-03-04 01:49:48,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:49:48,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:49:48,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:49:48,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:49:48,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:49:48,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:49:48" (1/1) ... [2025-03-04 01:49:48,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f1bb135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:48, skipping insertion in model container [2025-03-04 01:49:48,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:49:48" (1/1) ... [2025-03-04 01:49:48,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:49:48,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i[917,930] [2025-03-04 01:49:48,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:49:49,006 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:49:49,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i[917,930] [2025-03-04 01:49:49,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:49:49,049 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:49:49,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:49 WrapperNode [2025-03-04 01:49:49,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:49:49,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:49:49,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:49:49,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:49:49,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:49" (1/1) ... [2025-03-04 01:49:49,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:49" (1/1) ... [2025-03-04 01:49:49,092 INFO L138 Inliner]: procedures = 34, calls = 133, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 415 [2025-03-04 01:49:49,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:49:49,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:49:49,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:49:49,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:49:49,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:49" (1/1) ... [2025-03-04 01:49:49,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:49" (1/1) ... [2025-03-04 01:49:49,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:49" (1/1) ... [2025-03-04 01:49:49,130 INFO L175 MemorySlicer]: Split 111 memory accesses to 2 slices as follows [2, 109]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27]. [2025-03-04 01:49:49,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:49" (1/1) ... [2025-03-04 01:49:49,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:49" (1/1) ... [2025-03-04 01:49:49,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:49" (1/1) ... [2025-03-04 01:49:49,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:49" (1/1) ... [2025-03-04 01:49:49,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:49" (1/1) ... [2025-03-04 01:49:49,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:49" (1/1) ... [2025-03-04 01:49:49,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:49:49,158 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:49:49,158 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:49:49,158 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:49:49,159 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:49" (1/1) ... [2025-03-04 01:49:49,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:49:49,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:49:49,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:49:49,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:49:49,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:49:49,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:49:49,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:49:49,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:49:49,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:49:49,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:49:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:49:49,301 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:49:49,303 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:49:49,707 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~mem59#1;havoc property_#t~ite71#1;havoc property_#t~mem63#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short81#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite91#1;havoc property_#t~ite88#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short110#1; [2025-03-04 01:49:49,741 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-04 01:49:49,741 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:49:49,749 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:49:49,749 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:49:49,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:49:49 BoogieIcfgContainer [2025-03-04 01:49:49,749 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:49:49,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:49:49,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:49:49,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:49:49,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:49:48" (1/3) ... [2025-03-04 01:49:49,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3597de73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:49:49, skipping insertion in model container [2025-03-04 01:49:49,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:49:49" (2/3) ... [2025-03-04 01:49:49,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3597de73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:49:49, skipping insertion in model container [2025-03-04 01:49:49,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:49:49" (3/3) ... [2025-03-04 01:49:49,758 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-31.i [2025-03-04 01:49:49,781 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:49:49,782 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-31.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:49:49,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:49:49,825 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;@897c93b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:49:49,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:49:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:49:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 01:49:49,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:49,834 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:49,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:49,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:49,838 INFO L85 PathProgramCache]: Analyzing trace with hash 173968285, now seen corresponding path program 1 times [2025-03-04 01:49:49,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:49:49,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814574449] [2025-03-04 01:49:49,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:49,846 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-03-04 01:49:49,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:49:49,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-04 01:49:49,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:49:49,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:49:50,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:49:50,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:50,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:50,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:49:50,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:49:50,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:50,091 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:49:50,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814574449] [2025-03-04 01:49:50,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814574449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:50,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:50,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:49:50,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922690457] [2025-03-04 01:49:50,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:50,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:49:50,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:49:50,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:49:50,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:49:50,114 INFO L87 Difference]: Start difference. First operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:50,136 INFO L93 Difference]: Finished difference Result 163 states and 253 transitions. [2025-03-04 01:49:50,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:49:50,138 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-03-04 01:49:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:50,142 INFO L225 Difference]: With dead ends: 163 [2025-03-04 01:49:50,143 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 01:49:50,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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-03-04 01:49:50,148 INFO L435 NwaCegarLoop]: 114 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, 114 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-03-04 01:49:50,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:49:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 01:49:50,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 01:49:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:49:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2025-03-04 01:49:50,177 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 94 [2025-03-04 01:49:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:50,178 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2025-03-04 01:49:50,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2025-03-04 01:49:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 01:49:50,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:50,180 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:50,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:49:50,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-04 01:49:50,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:50,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:50,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1199022906, now seen corresponding path program 1 times [2025-03-04 01:49:50,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:49:50,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97963246] [2025-03-04 01:49:50,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:50,382 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-03-04 01:49:50,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:49:50,384 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-04 01:49:50,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:49:50,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:49:50,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:49:50,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:50,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:50,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:49:50,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:50,635 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 17 treesize of output 9 [2025-03-04 01:49:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:49:50,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:50,667 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:49:50,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97963246] [2025-03-04 01:49:50,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97963246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:50,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:50,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:49:50,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632604878] [2025-03-04 01:49:50,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:50,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:49:50,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:49:50,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:49:50,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:49:50,668 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:50,689 INFO L93 Difference]: Finished difference Result 157 states and 225 transitions. [2025-03-04 01:49:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:49:50,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-03-04 01:49:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:50,691 INFO L225 Difference]: With dead ends: 157 [2025-03-04 01:49:50,691 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 01:49:50,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 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-03-04 01:49:50,692 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:50,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:49:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 01:49:50,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 01:49:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:49:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2025-03-04 01:49:50,698 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 94 [2025-03-04 01:49:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:50,699 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2025-03-04 01:49:50,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2025-03-04 01:49:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 01:49:50,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:50,700 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:50,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2025-03-04 01:49:50,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-04 01:49:50,901 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:50,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:50,901 INFO L85 PathProgramCache]: Analyzing trace with hash 154286791, now seen corresponding path program 1 times [2025-03-04 01:49:50,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:49:50,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801522813] [2025-03-04 01:49:50,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:50,902 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-03-04 01:49:50,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:49:50,903 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-04 01:49:50,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:49:50,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:49:51,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:49:51,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:51,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:51,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 01:49:51,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:52,440 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 26 treesize of output 29 [2025-03-04 01:49:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:49:52,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:52,553 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:49:52,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801522813] [2025-03-04 01:49:52,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801522813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:52,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:52,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:49:52,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254368126] [2025-03-04 01:49:52,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:52,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:49:52,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:49:52,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:49:52,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:49:52,554 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:53,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:53,201 INFO L93 Difference]: Finished difference Result 191 states and 270 transitions. [2025-03-04 01:49:53,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:49:53,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-03-04 01:49:53,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:53,203 INFO L225 Difference]: With dead ends: 191 [2025-03-04 01:49:53,203 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 01:49:53,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:49:53,204 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 145 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:53,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 292 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:49:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 01:49:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 84. [2025-03-04 01:49:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:49:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2025-03-04 01:49:53,218 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 94 [2025-03-04 01:49:53,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:53,220 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2025-03-04 01:49:53,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2025-03-04 01:49:53,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:49:53,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:53,221 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:53,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:49:53,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-04 01:49:53,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:53,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:53,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1944467269, now seen corresponding path program 1 times [2025-03-04 01:49:53,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:49:53,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735741243] [2025-03-04 01:49:53,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:53,423 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-03-04 01:49:53,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:49:53,429 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-04 01:49:53,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:49:53,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:49:53,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:49:53,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:53,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:53,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:49:53,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:53,633 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 17 treesize of output 9 [2025-03-04 01:49:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:49:53,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:49:53,643 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:49:53,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735741243] [2025-03-04 01:49:53,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735741243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:49:53,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:49:53,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:49:53,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837877843] [2025-03-04 01:49:53,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:49:53,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:49:53,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:49:53,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:49:53,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:49:53,645 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:53,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:49:53,665 INFO L93 Difference]: Finished difference Result 165 states and 233 transitions. [2025-03-04 01:49:53,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:49:53,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-03-04 01:49:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:49:53,667 INFO L225 Difference]: With dead ends: 165 [2025-03-04 01:49:53,667 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 01:49:53,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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-03-04 01:49:53,668 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:49:53,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:49:53,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 01:49:53,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-04 01:49:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:49:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 117 transitions. [2025-03-04 01:49:53,679 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 117 transitions. Word has length 96 [2025-03-04 01:49:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:49:53,679 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 117 transitions. [2025-03-04 01:49:53,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:49:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 117 transitions. [2025-03-04 01:49:53,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:49:53,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:49:53,681 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:49:53,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2025-03-04 01:49:53,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-03-04 01:49:53,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:53,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1747953764, now seen corresponding path program 1 times [2025-03-04 01:49:53,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:49:53,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659328677] [2025-03-04 01:49:53,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:53,883 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-03-04 01:49:53,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:49:53,885 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-03-04 01:49:53,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:49:53,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:49:54,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:49:54,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:54,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:54,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 01:49:54,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:54,701 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 8 treesize of output 1 [2025-03-04 01:49:55,100 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 15 treesize of output 1 [2025-03-04 01:49:55,443 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 15 treesize of output 1 [2025-03-04 01:49:55,789 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 15 treesize of output 1 [2025-03-04 01:49:56,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2025-03-04 01:49:57,974 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 24 treesize of output 12 [2025-03-04 01:49:58,037 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 33 treesize of output 38 [2025-03-04 01:49:58,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2025-03-04 01:50:00,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 63 [2025-03-04 01:50:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 01:50:03,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:50:31,659 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:50:31,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659328677] [2025-03-04 01:50:31,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659328677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:50:31,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [468147440] [2025-03-04 01:50:31,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:50:31,659 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:50:31,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:50:31,679 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:50:31,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-04 01:50:31,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:50:32,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:50:32,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:50:32,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:50:32,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 01:50:32,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:50:35,796 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 15 treesize of output 1 [2025-03-04 01:50:36,254 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 15 treesize of output 1 [2025-03-04 01:50:36,783 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 15 treesize of output 1 [2025-03-04 01:50:37,321 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-03-04 01:50:40,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2025-03-04 01:50:43,696 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 40 treesize of output 34 [2025-03-04 01:50:43,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 60 [2025-03-04 01:50:52,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 71