./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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-21.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 abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:55:14,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:55:14,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:55:14,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:55:14,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:55:14,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:55:14,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:55:14,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:55:14,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:55:14,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:55:14,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:55:14,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:55:14,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:55:14,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:55:14,545 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:55:14,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:55:14,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:55:14,545 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:55:14,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:55:14,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:55:14,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:55:14,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:55:14,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:55:14,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:55:14,547 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:55:14,547 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:55:14,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:55:14,548 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:55:14,548 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:55:14,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:55:14,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:55:14,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:55:14,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:55:14,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:55:14,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:55:14,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:55:14,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:55:14,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:55:14,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:55:14,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:55:14,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:55:14,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:55:14,551 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 [2024-11-10 09:55:14,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:55:14,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:55:14,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:55:14,797 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:55:14,797 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:55:14,798 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-21.i [2024-11-10 09:55:16,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:55:16,219 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:55:16,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i [2024-11-10 09:55:16,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a97ed737/1e4904e7d0bf43999f67e39be2340071/FLAG359386932 [2024-11-10 09:55:16,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a97ed737/1e4904e7d0bf43999f67e39be2340071 [2024-11-10 09:55:16,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:55:16,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:55:16,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:55:16,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:55:16,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:55:16,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:55:16" (1/1) ... [2024-11-10 09:55:16,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f712c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:16, skipping insertion in model container [2024-11-10 09:55:16,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:55:16" (1/1) ... [2024-11-10 09:55:16,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:55:16,802 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-21.i[917,930] [2024-11-10 09:55:16,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:55:16,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:55:16,883 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-21.i[917,930] [2024-11-10 09:55:16,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:55:16,947 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:55:16,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:16 WrapperNode [2024-11-10 09:55:16,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:55:16,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:55:16,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:55:16,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:55:16,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:16" (1/1) ... [2024-11-10 09:55:16,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:16" (1/1) ... [2024-11-10 09:55:17,004 INFO L138 Inliner]: procedures = 29, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2024-11-10 09:55:17,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:55:17,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:55:17,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:55:17,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:55:17,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:16" (1/1) ... [2024-11-10 09:55:17,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:16" (1/1) ... [2024-11-10 09:55:17,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:16" (1/1) ... [2024-11-10 09:55:17,055 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-11-10 09:55:17,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:16" (1/1) ... [2024-11-10 09:55:17,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:16" (1/1) ... [2024-11-10 09:55:17,067 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:16" (1/1) ... [2024-11-10 09:55:17,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:16" (1/1) ... [2024-11-10 09:55:17,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:16" (1/1) ... [2024-11-10 09:55:17,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:16" (1/1) ... [2024-11-10 09:55:17,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:55:17,082 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:55:17,082 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:55:17,082 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:55:17,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:16" (1/1) ... [2024-11-10 09:55:17,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:55:17,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:55:17,132 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) [2024-11-10 09:55:17,137 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 [2024-11-10 09:55:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:55:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:55:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:55:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:55:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:55:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:55:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:55:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:55:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:55:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:55:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:55:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:55:17,191 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:55:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:55:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:55:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:55:17,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:55:17,298 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:55:17,301 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:55:17,671 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc property_#t~ite75#1;havoc property_#t~ite73#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite89#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~ite106#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite105#1;havoc property_#t~mem102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short107#1; [2024-11-10 09:55:17,703 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-10 09:55:17,703 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:55:17,718 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:55:17,719 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:55:17,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:55:17 BoogieIcfgContainer [2024-11-10 09:55:17,720 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:55:17,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:55:17,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:55:17,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:55:17,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:55:16" (1/3) ... [2024-11-10 09:55:17,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f25cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:55:17, skipping insertion in model container [2024-11-10 09:55:17,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:16" (2/3) ... [2024-11-10 09:55:17,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f25cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:55:17, skipping insertion in model container [2024-11-10 09:55:17,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:55:17" (3/3) ... [2024-11-10 09:55:17,730 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-21.i [2024-11-10 09:55:17,744 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:55:17,744 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:55:17,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:55:17,815 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;@18aedc42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:55:17,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:55:17,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 09:55:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:55:17,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:17,830 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:17,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:17,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:17,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1462009709, now seen corresponding path program 1 times [2024-11-10 09:55:17,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:17,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864666398] [2024-11-10 09:55:17,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:17,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:55:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:55:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:55:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:55:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 09:55:18,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:18,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864666398] [2024-11-10 09:55:18,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864666398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:18,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:18,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:55:18,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584441210] [2024-11-10 09:55:18,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:18,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:55:18,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:18,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:55:18,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:55:18,139 INFO L87 Difference]: Start difference. First operand has 99 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 09:55:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:18,181 INFO L93 Difference]: Finished difference Result 190 states and 290 transitions. [2024-11-10 09:55:18,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:55:18,186 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 82 [2024-11-10 09:55:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:18,195 INFO L225 Difference]: With dead ends: 190 [2024-11-10 09:55:18,209 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 09:55:18,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:55:18,219 INFO L432 NwaCegarLoop]: 137 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, 137 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 [2024-11-10 09:55:18,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:55:18,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 09:55:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 09:55:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 09:55:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2024-11-10 09:55:18,252 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 82 [2024-11-10 09:55:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:18,253 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2024-11-10 09:55:18,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 09:55:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2024-11-10 09:55:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:55:18,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:18,256 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:18,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:55:18,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:18,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash 809860656, now seen corresponding path program 1 times [2024-11-10 09:55:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:18,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237643409] [2024-11-10 09:55:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:18,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:55:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:55:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:55:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:55:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 09:55:18,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:18,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237643409] [2024-11-10 09:55:18,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237643409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:18,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:18,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:55:18,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945507947] [2024-11-10 09:55:18,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:18,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:55:18,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:18,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:55:18,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:55:18,480 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 09:55:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:18,518 INFO L93 Difference]: Finished difference Result 187 states and 274 transitions. [2024-11-10 09:55:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:55:18,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 82 [2024-11-10 09:55:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:18,520 INFO L225 Difference]: With dead ends: 187 [2024-11-10 09:55:18,520 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 09:55:18,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:55:18,522 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:18,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 394 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:55:18,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 09:55:18,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 09:55:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 09:55:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 139 transitions. [2024-11-10 09:55:18,535 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 139 transitions. Word has length 82 [2024-11-10 09:55:18,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:18,536 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 139 transitions. [2024-11-10 09:55:18,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 09:55:18,536 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 139 transitions. [2024-11-10 09:55:18,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:55:18,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:18,538 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:18,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:55:18,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:18,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1554487535, now seen corresponding path program 1 times [2024-11-10 09:55:18,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:18,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906438702] [2024-11-10 09:55:18,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:18,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:55:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:55:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:55:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:55:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 09:55:19,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906438702] [2024-11-10 09:55:19,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906438702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:19,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:19,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:55:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393555620] [2024-11-10 09:55:19,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:19,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:55:19,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:19,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:55:19,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:55:19,340 INFO L87 Difference]: Start difference. First operand 96 states and 139 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 09:55:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:19,638 INFO L93 Difference]: Finished difference Result 315 states and 457 transitions. [2024-11-10 09:55:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:55:19,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 82 [2024-11-10 09:55:19,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:19,640 INFO L225 Difference]: With dead ends: 315 [2024-11-10 09:55:19,640 INFO L226 Difference]: Without dead ends: 222 [2024-11-10 09:55:19,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:55:19,642 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 199 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:19,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 628 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:55:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-10 09:55:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 192. [2024-11-10 09:55:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 175 states have (on average 1.4228571428571428) internal successors, (249), 175 states have internal predecessors, (249), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:55:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 277 transitions. [2024-11-10 09:55:19,656 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 277 transitions. Word has length 82 [2024-11-10 09:55:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:19,656 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 277 transitions. [2024-11-10 09:55:19,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 09:55:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 277 transitions. [2024-11-10 09:55:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 09:55:19,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:19,658 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:19,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:55:19,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:19,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:19,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1617162122, now seen corresponding path program 1 times [2024-11-10 09:55:19,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:19,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902722686] [2024-11-10 09:55:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:55:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:55:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:55:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:55:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 09:55:19,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:19,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902722686] [2024-11-10 09:55:19,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902722686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:19,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:19,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:55:19,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942931777] [2024-11-10 09:55:19,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:19,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:55:19,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:19,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:55:19,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:55:19,801 INFO L87 Difference]: Start difference. First operand 192 states and 277 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 09:55:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:19,829 INFO L93 Difference]: Finished difference Result 384 states and 555 transitions. [2024-11-10 09:55:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:55:19,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-11-10 09:55:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:19,834 INFO L225 Difference]: With dead ends: 384 [2024-11-10 09:55:19,835 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 09:55:19,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:55:19,836 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:19,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:55:19,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 09:55:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-10 09:55:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 178 states have (on average 1.4101123595505618) internal successors, (251), 178 states have internal predecessors, (251), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:55:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 279 transitions. [2024-11-10 09:55:19,850 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 279 transitions. Word has length 85 [2024-11-10 09:55:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:19,850 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 279 transitions. [2024-11-10 09:55:19,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 09:55:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 279 transitions. [2024-11-10 09:55:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 09:55:19,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:19,855 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:19,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:55:19,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:19,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:19,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1641028383, now seen corresponding path program 1 times [2024-11-10 09:55:19,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:19,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868642146] [2024-11-10 09:55:19,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:19,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:20,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:55:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:20,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:20,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:55:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:20,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:20,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:55:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:20,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:55:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:20,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 09:55:20,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:20,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868642146] [2024-11-10 09:55:20,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868642146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:20,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:20,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 09:55:20,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71245094] [2024-11-10 09:55:20,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:20,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 09:55:20,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:20,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 09:55:20,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:55:20,792 INFO L87 Difference]: Start difference. First operand 195 states and 279 transitions. Second operand has 12 states, 10 states have (on average 5.7) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-10 09:55:21,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:21,397 INFO L93 Difference]: Finished difference Result 432 states and 610 transitions. [2024-11-10 09:55:21,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 09:55:21,398 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.7) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) Word has length 89 [2024-11-10 09:55:21,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:21,400 INFO L225 Difference]: With dead ends: 432 [2024-11-10 09:55:21,400 INFO L226 Difference]: Without dead ends: 336 [2024-11-10 09:55:21,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-10 09:55:21,402 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 412 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:21,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1010 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:55:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-10 09:55:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 309. [2024-11-10 09:55:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 284 states have (on average 1.4014084507042253) internal successors, (398), 286 states have internal predecessors, (398), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:55:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 438 transitions. [2024-11-10 09:55:21,426 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 438 transitions. Word has length 89 [2024-11-10 09:55:21,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:21,426 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 438 transitions. [2024-11-10 09:55:21,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.7) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-10 09:55:21,426 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 438 transitions. [2024-11-10 09:55:21,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 09:55:21,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:21,427 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:21,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:55:21,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:21,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:21,428 INFO L85 PathProgramCache]: Analyzing trace with hash 174136704, now seen corresponding path program 1 times [2024-11-10 09:55:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:21,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498261179] [2024-11-10 09:55:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:55:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:55:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:55:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:55:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 09:55:22,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:22,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498261179] [2024-11-10 09:55:22,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498261179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:22,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:22,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 09:55:22,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756407320] [2024-11-10 09:55:22,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:22,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 09:55:22,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:22,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 09:55:22,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:55:22,462 INFO L87 Difference]: Start difference. First operand 309 states and 438 transitions. Second operand has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-10 09:55:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:22,814 INFO L93 Difference]: Finished difference Result 568 states and 800 transitions. [2024-11-10 09:55:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:55:22,815 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) Word has length 90 [2024-11-10 09:55:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:22,818 INFO L225 Difference]: With dead ends: 568 [2024-11-10 09:55:22,818 INFO L226 Difference]: Without dead ends: 390 [2024-11-10 09:55:22,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:55:22,819 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 299 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:22,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 640 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:55:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-10 09:55:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 329. [2024-11-10 09:55:22,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 304 states have (on average 1.394736842105263) internal successors, (424), 306 states have internal predecessors, (424), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:55:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 464 transitions. [2024-11-10 09:55:22,837 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 464 transitions. Word has length 90 [2024-11-10 09:55:22,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:22,838 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 464 transitions. [2024-11-10 09:55:22,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-10 09:55:22,838 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 464 transitions. [2024-11-10 09:55:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:55:22,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:22,839 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:22,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:55:22,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:22,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:22,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1944191905, now seen corresponding path program 1 times [2024-11-10 09:55:22,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:22,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323538297] [2024-11-10 09:55:22,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:22,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:55:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:55:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:55:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:55:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 09:55:22,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:22,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323538297] [2024-11-10 09:55:22,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323538297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:22,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:22,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:55:22,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9363118] [2024-11-10 09:55:22,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:22,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:55:22,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:22,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:55:22,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:55:22,984 INFO L87 Difference]: Start difference. First operand 329 states and 464 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 09:55:23,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:23,157 INFO L93 Difference]: Finished difference Result 698 states and 976 transitions. [2024-11-10 09:55:23,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:55:23,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2024-11-10 09:55:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:23,161 INFO L225 Difference]: With dead ends: 698 [2024-11-10 09:55:23,161 INFO L226 Difference]: Without dead ends: 397 [2024-11-10 09:55:23,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:55:23,162 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 192 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:23,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 456 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:55:23,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-10 09:55:23,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 331. [2024-11-10 09:55:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 306 states have (on average 1.3790849673202614) internal successors, (422), 308 states have internal predecessors, (422), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:55:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 462 transitions. [2024-11-10 09:55:23,179 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 462 transitions. Word has length 91 [2024-11-10 09:55:23,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:23,179 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 462 transitions. [2024-11-10 09:55:23,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 09:55:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 462 transitions. [2024-11-10 09:55:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:55:23,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:23,181 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:23,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:55:23,181 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:23,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:23,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1099720034, now seen corresponding path program 1 times [2024-11-10 09:55:23,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:23,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941541830] [2024-11-10 09:55:23,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:23,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:23,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:55:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:23,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:23,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:55:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:23,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:23,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:55:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:23,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:55:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:23,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 09:55:23,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941541830] [2024-11-10 09:55:23,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941541830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:23,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:23,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:55:23,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482406945] [2024-11-10 09:55:23,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:23,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:55:23,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:23,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:55:23,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:55:23,580 INFO L87 Difference]: Start difference. First operand 331 states and 462 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 09:55:23,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:23,938 INFO L93 Difference]: Finished difference Result 712 states and 987 transitions. [2024-11-10 09:55:23,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:55:23,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2024-11-10 09:55:23,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:23,942 INFO L225 Difference]: With dead ends: 712 [2024-11-10 09:55:23,942 INFO L226 Difference]: Without dead ends: 409 [2024-11-10 09:55:23,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:55:23,943 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 205 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:23,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 826 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:55:23,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-10 09:55:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 334. [2024-11-10 09:55:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 309 states have (on average 1.3754045307443366) internal successors, (425), 311 states have internal predecessors, (425), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:55:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 465 transitions. [2024-11-10 09:55:23,964 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 465 transitions. Word has length 91 [2024-11-10 09:55:23,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:23,965 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 465 transitions. [2024-11-10 09:55:23,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 09:55:23,965 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 465 transitions. [2024-11-10 09:55:23,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:55:23,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:23,966 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:23,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:55:23,967 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:23,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:23,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1450707480, now seen corresponding path program 1 times [2024-11-10 09:55:23,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:23,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730345594] [2024-11-10 09:55:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:23,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:24,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:55:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:24,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:55:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:24,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:55:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:24,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:55:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:24,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:55:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:24,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:55:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:24,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:55:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 09:55:24,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:55:24,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730345594] [2024-11-10 09:55:24,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730345594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:24,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:24,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:55:24,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593373809] [2024-11-10 09:55:24,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:24,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:55:24,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:55:24,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:55:24,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:55:24,110 INFO L87 Difference]: Start difference. First operand 334 states and 465 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 09:55:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:24,153 INFO L93 Difference]: Finished difference Result 349 states and 482 transitions. [2024-11-10 09:55:24,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:55:24,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2024-11-10 09:55:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:24,155 INFO L225 Difference]: With dead ends: 349 [2024-11-10 09:55:24,155 INFO L226 Difference]: Without dead ends: 346 [2024-11-10 09:55:24,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:55:24,157 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:24,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 902 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:55:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-10 09:55:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-11-10 09:55:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 321 states have (on average 1.3613707165109035) internal successors, (437), 323 states have internal predecessors, (437), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 09:55:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 477 transitions. [2024-11-10 09:55:24,176 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 477 transitions. Word has length 91 [2024-11-10 09:55:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:24,176 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 477 transitions. [2024-11-10 09:55:24,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 09:55:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 477 transitions. [2024-11-10 09:55:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 09:55:24,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:24,179 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:24,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:55:24,179 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:24,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:24,179 INFO L85 PathProgramCache]: Analyzing trace with hash 166089603, now seen corresponding path program 1 times [2024-11-10 09:55:24,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:55:24,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622318708] [2024-11-10 09:55:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:24,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:55:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:55:24,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [90721315] [2024-11-10 09:55:24,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:24,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:55:24,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:55:24,215 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) [2024-11-10 09:55:24,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:55:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:55:24,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:55:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:55:24,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:55:24,531 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:55:24,532 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:55:24,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 09:55:24,737 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,SelfDestructingSolverStorable9 [2024-11-10 09:55:24,741 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:24,819 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:55:24,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:55:24 BoogieIcfgContainer [2024-11-10 09:55:24,825 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:55:24,825 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:55:24,825 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:55:24,825 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:55:24,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:55:17" (3/4) ... [2024-11-10 09:55:24,828 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:55:24,829 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:55:24,829 INFO L158 Benchmark]: Toolchain (without parser) took 8209.95ms. Allocated memory was 169.9MB in the beginning and 323.0MB in the end (delta: 153.1MB). Free memory was 94.9MB in the beginning and 115.3MB in the end (delta: -20.4MB). Peak memory consumption was 134.7MB. Max. memory is 16.1GB. [2024-11-10 09:55:24,829 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 169.9MB. Free memory was 120.5MB in the beginning and 120.4MB in the end (delta: 119.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:55:24,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.52ms. Allocated memory was 169.9MB in the beginning and 222.3MB in the end (delta: 52.4MB). Free memory was 94.8MB in the beginning and 192.4MB in the end (delta: -97.6MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-10 09:55:24,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.50ms. Allocated memory is still 222.3MB. Free memory was 192.4MB in the beginning and 189.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:55:24,830 INFO L158 Benchmark]: Boogie Preprocessor took 72.05ms. Allocated memory is still 222.3MB. Free memory was 189.2MB in the beginning and 185.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:55:24,831 INFO L158 Benchmark]: IcfgBuilder took 638.79ms. Allocated memory is still 222.3MB. Free memory was 185.0MB in the beginning and 155.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-10 09:55:24,831 INFO L158 Benchmark]: TraceAbstraction took 7101.07ms. Allocated memory was 222.3MB in the beginning and 323.0MB in the end (delta: 100.7MB). Free memory was 154.6MB in the beginning and 115.3MB in the end (delta: 39.3MB). Peak memory consumption was 139.9MB. Max. memory is 16.1GB. [2024-11-10 09:55:24,831 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 323.0MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:55:24,832 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 169.9MB. Free memory was 120.5MB in the beginning and 120.4MB in the end (delta: 119.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.52ms. Allocated memory was 169.9MB in the beginning and 222.3MB in the end (delta: 52.4MB). Free memory was 94.8MB in the beginning and 192.4MB in the end (delta: -97.6MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.50ms. Allocated memory is still 222.3MB. Free memory was 192.4MB in the beginning and 189.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.05ms. Allocated memory is still 222.3MB. Free memory was 189.2MB in the beginning and 185.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 638.79ms. Allocated memory is still 222.3MB. Free memory was 185.0MB in the beginning and 155.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7101.07ms. Allocated memory was 222.3MB in the beginning and 323.0MB in the end (delta: 100.7MB). Free memory was 154.6MB in the beginning and 115.3MB in the end (delta: 39.3MB). Peak memory consumption was 139.9MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 323.0MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 96. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L45] unsigned short int* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] unsigned char* WrapperStruct0_var_1_7_Pointer = &(WrapperStruct0.var_1_7); [L47] double* WrapperStruct0_var_1_8_Pointer = &(WrapperStruct0.var_1_8); [L48] double* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L49] double* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L50] unsigned char* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L51] signed short int* WrapperStruct0_var_1_13_Pointer = &(WrapperStruct0.var_1_13); [L52] float* WrapperStruct0_var_1_14_Pointer = &(WrapperStruct0.var_1_14); [L53] float* WrapperStruct0_var_1_15_Pointer = &(WrapperStruct0.var_1_15); [L54] unsigned char last_1_WrapperStruct0_var_1_7 = 0; [L55] signed short int last_1_WrapperStruct0_var_1_13 = 256; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=0, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L99] EXPR WrapperStruct0.var_1_7 [L99] last_1_WrapperStruct0_var_1_7 = WrapperStruct0.var_1_7 [L100] EXPR WrapperStruct0.var_1_13 [L100] last_1_WrapperStruct0_var_1_13 = WrapperStruct0.var_1_13 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L84] WrapperStruct0.var_1_8 = __VERIFIER_nondet_double() [L85] EXPR WrapperStruct0.var_1_8 [L85] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F [L85] EXPR WrapperStruct0.var_1_8 [L85] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] CALL assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] RET assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L86] WrapperStruct0.var_1_9 = __VERIFIER_nondet_double() [L87] EXPR WrapperStruct0.var_1_9 [L87] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F [L87] EXPR WrapperStruct0.var_1_9 [L87] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR (WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR (WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] CALL assume_abort_if_not((WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] RET assume_abort_if_not((WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L88] WrapperStruct0.var_1_10 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct0.var_1_10 [L89] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F [L89] EXPR WrapperStruct0.var_1_10 [L89] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] EXPR (WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] EXPR (WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] CALL assume_abort_if_not((WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] RET assume_abort_if_not((WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L90] WrapperStruct0.var_1_12 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L91] CALL assume_abort_if_not(WrapperStruct0.var_1_12 >= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L91] RET assume_abort_if_not(WrapperStruct0.var_1_12 >= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L92] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_12 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_12 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L93] WrapperStruct0.var_1_14 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct0.var_1_14 [L94] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F [L94] EXPR WrapperStruct0.var_1_14 [L94] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] CALL assume_abort_if_not((WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] RET assume_abort_if_not((WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L95] WrapperStruct0.var_1_15 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct0.var_1_15 [L96] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F [L96] EXPR WrapperStruct0.var_1_15 [L96] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] EXPR (WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] EXPR (WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] CALL assume_abort_if_not((WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] RET assume_abort_if_not((WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L111] RET updateVariables() [L112] CALL step() [L59] COND TRUE (last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L60] COND FALSE !(last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L68] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L68] COND TRUE (*(WrapperStruct0_var_1_12_Pointer)) [L69] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_15_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_10_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L69] COND FALSE !(((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) [L72] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L72] (*(WrapperStruct0_var_1_13_Pointer)) = (*(WrapperStruct0_var_1_1_Pointer)) [L75] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L75] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) [L75] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L75] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L75] EXPR \read(*WrapperStruct0_var_1_10_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L75] COND TRUE (((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer)) [L76] last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] COND FALSE !(last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR ((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1 [L103] EXPR (last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer))))) [L103] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L103] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) [L103] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L103] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR \read(*WrapperStruct0_var_1_10_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) [L103] EXPR \read(*WrapperStruct0_var_1_7_Pointer) [L103] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L103] EXPR ((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))))) && ((*(WrapperStruct0_var_1_12_Pointer)) ? ((((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (((((*(WrapperStruct0_var_1_1_Pointer))) > ((*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer))) : ((*(WrapperStruct0_var_1_1_Pointer))))))) : ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct0_var_1_1_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))))) && ((*(WrapperStruct0_var_1_12_Pointer)) ? ((((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (((((*(WrapperStruct0_var_1_1_Pointer))) > ((*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer))) : ((*(WrapperStruct0_var_1_1_Pointer))))))) : ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct0_var_1_1_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103-L104] return ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))))) && ((*(WrapperStruct0_var_1_12_Pointer)) ? ((((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (((((*(WrapperStruct0_var_1_1_Pointer))) > ((*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer))) : ((*(WrapperStruct0_var_1_1_Pointer))))))) : ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct0_var_1_1_Pointer))))) : 1) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1311 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1307 mSDsluCounter, 5514 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4358 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2002 IncrementalHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 1156 mSDtfsCounter, 2002 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=9, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 259 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 967 NumberOfCodeBlocks, 967 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 774 ConstructedInterpolants, 0 QuantifiedInterpolants, 3978 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 756/756 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:55:24,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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-21.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 abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:55:26,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:55:26,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:55:26,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:55:26,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:55:26,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:55:26,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:55:26,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:55:26,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:55:26,938 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:55:26,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:55:26,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:55:26,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:55:26,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:55:26,941 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:55:26,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:55:26,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:55:26,942 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:55:26,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:55:26,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:55:26,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:55:26,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:55:26,947 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:55:26,947 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:55:26,947 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:55:26,948 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:55:26,948 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:55:26,948 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:55:26,948 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:55:26,948 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:55:26,948 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:55:26,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:55:26,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:55:26,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:55:26,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:55:26,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:55:26,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:55:26,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:55:26,950 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:55:26,950 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:55:26,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:55:26,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:55:26,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:55:26,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:55:26,956 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 [2024-11-10 09:55:27,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:55:27,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:55:27,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:55:27,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:55:27,259 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:55:27,260 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-21.i [2024-11-10 09:55:28,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:55:28,878 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:55:28,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i [2024-11-10 09:55:28,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a4b17c42/237bb15e78014435bf7489ebf48bdb14/FLAG9f52d8419 [2024-11-10 09:55:28,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a4b17c42/237bb15e78014435bf7489ebf48bdb14 [2024-11-10 09:55:28,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:55:28,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:55:28,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:55:28,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:55:28,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:55:28,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:55:28" (1/1) ... [2024-11-10 09:55:28,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b0c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:28, skipping insertion in model container [2024-11-10 09:55:28,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:55:28" (1/1) ... [2024-11-10 09:55:28,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:55:29,114 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-21.i[917,930] [2024-11-10 09:55:29,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:55:29,219 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:55:29,231 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-21.i[917,930] [2024-11-10 09:55:29,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:55:29,286 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:55:29,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:29 WrapperNode [2024-11-10 09:55:29,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:55:29,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:55:29,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:55:29,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:55:29,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:29" (1/1) ... [2024-11-10 09:55:29,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:29" (1/1) ... [2024-11-10 09:55:29,332 INFO L138 Inliner]: procedures = 36, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2024-11-10 09:55:29,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:55:29,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:55:29,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:55:29,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:55:29,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:29" (1/1) ... [2024-11-10 09:55:29,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:29" (1/1) ... [2024-11-10 09:55:29,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:29" (1/1) ... [2024-11-10 09:55:29,372 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-11-10 09:55:29,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:29" (1/1) ... [2024-11-10 09:55:29,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:29" (1/1) ... [2024-11-10 09:55:29,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:29" (1/1) ... [2024-11-10 09:55:29,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:29" (1/1) ... [2024-11-10 09:55:29,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:29" (1/1) ... [2024-11-10 09:55:29,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:29" (1/1) ... [2024-11-10 09:55:29,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:55:29,411 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:55:29,411 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:55:29,411 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:55:29,412 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:29" (1/1) ... [2024-11-10 09:55:29,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:55:29,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:55:29,449 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) [2024-11-10 09:55:29,452 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 [2024-11-10 09:55:29,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-10 09:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-10 09:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-10 09:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-10 09:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-10 09:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-10 09:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-10 09:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-10 09:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-10 09:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-10 09:55:29,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-10 09:55:29,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-10 09:55:29,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-10 09:55:29,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-10 09:55:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-10 09:55:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-10 09:55:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:55:29,501 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:55:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:55:29,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:55:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:55:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:55:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-10 09:55:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-10 09:55:29,650 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:55:29,654 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:55:40,421 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc property_#t~ite75#1;havoc property_#t~ite73#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite89#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~ite106#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite105#1;havoc property_#t~mem102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short107#1; [2024-11-10 09:55:40,448 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-10 09:55:40,448 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:55:40,459 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:55:40,459 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:55:40,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:55:40 BoogieIcfgContainer [2024-11-10 09:55:40,460 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:55:40,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:55:40,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:55:40,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:55:40,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:55:28" (1/3) ... [2024-11-10 09:55:40,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344947d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:55:40, skipping insertion in model container [2024-11-10 09:55:40,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:29" (2/3) ... [2024-11-10 09:55:40,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344947d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:55:40, skipping insertion in model container [2024-11-10 09:55:40,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:55:40" (3/3) ... [2024-11-10 09:55:40,474 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-21.i [2024-11-10 09:55:40,489 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:55:40,489 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:55:40,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:55:40,558 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;@69208434, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:55:40,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:55:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 09:55:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:55:40,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:40,579 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:40,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:40,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:40,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1462009709, now seen corresponding path program 1 times [2024-11-10 09:55:40,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:55:40,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544388738] [2024-11-10 09:55:40,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:40,603 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 [2024-11-10 09:55:40,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:55:40,606 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) [2024-11-10 09:55:40,608 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 [2024-11-10 09:55:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:40,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:55:40,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:55:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-10 09:55:40,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:55:40,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:55:40,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544388738] [2024-11-10 09:55:40,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544388738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:40,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:40,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:55:40,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096827746] [2024-11-10 09:55:40,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:40,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:55:40,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:55:40,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:55:40,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:55:40,967 INFO L87 Difference]: Start difference. First operand has 99 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 09:55:40,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:40,992 INFO L93 Difference]: Finished difference Result 190 states and 290 transitions. [2024-11-10 09:55:40,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:55:40,994 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 82 [2024-11-10 09:55:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:41,004 INFO L225 Difference]: With dead ends: 190 [2024-11-10 09:55:41,004 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 09:55:41,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:55:41,013 INFO L432 NwaCegarLoop]: 137 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, 137 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 [2024-11-10 09:55:41,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:55:41,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 09:55:41,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 09:55:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 09:55:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2024-11-10 09:55:41,056 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 82 [2024-11-10 09:55:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:41,061 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2024-11-10 09:55:41,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 09:55:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2024-11-10 09:55:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:55:41,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:41,064 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:41,078 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 (2)] Forceful destruction successful, exit code 0 [2024-11-10 09:55:41,268 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 [2024-11-10 09:55:41,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:41,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:41,269 INFO L85 PathProgramCache]: Analyzing trace with hash 809860656, now seen corresponding path program 1 times [2024-11-10 09:55:41,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:55:41,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417879924] [2024-11-10 09:55:41,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:41,280 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 [2024-11-10 09:55:41,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:55:41,283 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) [2024-11-10 09:55:41,284 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 [2024-11-10 09:55:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:41,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:55:41,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:55:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-10 09:55:41,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:55:41,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:55:41,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417879924] [2024-11-10 09:55:41,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417879924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:41,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:41,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:55:41,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750548732] [2024-11-10 09:55:41,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:41,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:55:41,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:55:41,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:55:41,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:55:41,638 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 09:55:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:55:41,733 INFO L93 Difference]: Finished difference Result 187 states and 274 transitions. [2024-11-10 09:55:41,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:55:41,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 82 [2024-11-10 09:55:41,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:55:41,735 INFO L225 Difference]: With dead ends: 187 [2024-11-10 09:55:41,736 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 09:55:41,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:55:41,738 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:55:41,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 394 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:55:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 09:55:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 09:55:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 09:55:41,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 139 transitions. [2024-11-10 09:55:41,754 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 139 transitions. Word has length 82 [2024-11-10 09:55:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:55:41,758 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 139 transitions. [2024-11-10 09:55:41,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 09:55:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 139 transitions. [2024-11-10 09:55:41,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 09:55:41,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:55:41,761 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:55:41,774 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 (3)] Ended with exit code 0 [2024-11-10 09:55:41,961 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 [2024-11-10 09:55:41,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:55:41,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:55:41,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1554487535, now seen corresponding path program 1 times [2024-11-10 09:55:41,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:55:41,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557736609] [2024-11-10 09:55:41,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:55:41,967 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 [2024-11-10 09:55:41,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:55:41,970 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) [2024-11-10 09:55:41,970 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 [2024-11-10 09:55:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:55:42,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:55:42,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:55:42,352 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 21 treesize of output 9 [2024-11-10 09:55:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 09:55:42,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:55:42,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:55:42,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557736609] [2024-11-10 09:55:42,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557736609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:55:42,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:55:42,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:55:42,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240682542] [2024-11-10 09:55:42,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:55:42,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:55:42,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:55:42,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:55:42,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:55:42,637 INFO L87 Difference]: Start difference. First operand 96 states and 139 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 09:55:45,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:55:46,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:55:50,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:55:54,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:55:57,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:55:59,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:56:03,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:56:06,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:56:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:06,079 INFO L93 Difference]: Finished difference Result 315 states and 457 transitions. [2024-11-10 09:56:06,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:56:06,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 82 [2024-11-10 09:56:06,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:06,103 INFO L225 Difference]: With dead ends: 315 [2024-11-10 09:56:06,103 INFO L226 Difference]: Without dead ends: 222 [2024-11-10 09:56:06,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:56:06,106 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 196 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:06,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 317 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 125 Invalid, 1 Unknown, 0 Unchecked, 23.4s Time] [2024-11-10 09:56:06,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-10 09:56:06,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 192. [2024-11-10 09:56:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 175 states have (on average 1.4228571428571428) internal successors, (249), 175 states have internal predecessors, (249), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:56:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 277 transitions. [2024-11-10 09:56:06,127 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 277 transitions. Word has length 82 [2024-11-10 09:56:06,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:06,127 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 277 transitions. [2024-11-10 09:56:06,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 09:56:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 277 transitions. [2024-11-10 09:56:06,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 09:56:06,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:06,130 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:56:06,142 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 (4)] Forceful destruction successful, exit code 0 [2024-11-10 09:56:06,330 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 [2024-11-10 09:56:06,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:06,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:06,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1617162122, now seen corresponding path program 1 times [2024-11-10 09:56:06,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:56:06,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468577237] [2024-11-10 09:56:06,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:06,332 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 [2024-11-10 09:56:06,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:56:06,336 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) [2024-11-10 09:56:06,337 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 [2024-11-10 09:56:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:06,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 09:56:06,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:56:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-10 09:56:06,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:56:06,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:56:06,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468577237] [2024-11-10 09:56:06,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468577237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:06,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:06,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:56:06,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939114656] [2024-11-10 09:56:06,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:06,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:56:06,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:56:06,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:56:06,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:56:06,670 INFO L87 Difference]: Start difference. First operand 192 states and 277 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 09:56:06,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:06,771 INFO L93 Difference]: Finished difference Result 384 states and 555 transitions. [2024-11-10 09:56:06,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:56:06,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-11-10 09:56:06,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:06,773 INFO L225 Difference]: With dead ends: 384 [2024-11-10 09:56:06,773 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 09:56:06,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:56:06,775 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:06,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:56:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 09:56:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-10 09:56:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 178 states have (on average 1.4101123595505618) internal successors, (251), 178 states have internal predecessors, (251), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:56:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 279 transitions. [2024-11-10 09:56:06,784 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 279 transitions. Word has length 85 [2024-11-10 09:56:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:06,785 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 279 transitions. [2024-11-10 09:56:06,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-10 09:56:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 279 transitions. [2024-11-10 09:56:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 09:56:06,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:06,790 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:56:06,810 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 [2024-11-10 09:56:06,999 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 [2024-11-10 09:56:07,000 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:07,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:07,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1641028383, now seen corresponding path program 1 times [2024-11-10 09:56:07,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:56:07,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812686271] [2024-11-10 09:56:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:07,001 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 [2024-11-10 09:56:07,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:56:07,003 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) [2024-11-10 09:56:07,010 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 [2024-11-10 09:56:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:07,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:56:07,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:56:07,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-10 09:56:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-10 09:56:07,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:56:07,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:56:07,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812686271] [2024-11-10 09:56:07,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812686271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:07,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:07,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:56:07,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011806202] [2024-11-10 09:56:07,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:07,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:56:07,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:56:07,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:56:07,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:56:07,662 INFO L87 Difference]: Start difference. First operand 195 states and 279 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 09:56:11,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:56:14,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:56:17,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:56:20,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:56:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:21,212 INFO L93 Difference]: Finished difference Result 389 states and 557 transitions. [2024-11-10 09:56:21,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:56:21,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2024-11-10 09:56:21,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:21,214 INFO L225 Difference]: With dead ends: 389 [2024-11-10 09:56:21,214 INFO L226 Difference]: Without dead ends: 197 [2024-11-10 09:56:21,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:56:21,215 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 103 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:21,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 394 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2024-11-10 09:56:21,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-10 09:56:21,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2024-11-10 09:56:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 178 states have (on average 1.398876404494382) internal successors, (249), 178 states have internal predecessors, (249), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:56:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 277 transitions. [2024-11-10 09:56:21,229 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 277 transitions. Word has length 89 [2024-11-10 09:56:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:21,230 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 277 transitions. [2024-11-10 09:56:21,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 09:56:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 277 transitions. [2024-11-10 09:56:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 09:56:21,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:21,231 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:56:21,246 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 (6)] Ended with exit code 0 [2024-11-10 09:56:21,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 [2024-11-10 09:56:21,432 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:21,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:21,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1421233375, now seen corresponding path program 1 times [2024-11-10 09:56:21,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:56:21,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557658869] [2024-11-10 09:56:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:21,434 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 [2024-11-10 09:56:21,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:56:21,436 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2024-11-10 09:56:21,437 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 (7)] Waiting until timeout for monitored process [2024-11-10 09:56:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:56:21,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:56:21,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-10 09:56:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 09:56:22,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:56:22,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:56:22,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557658869] [2024-11-10 09:56:22,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557658869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:22,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:22,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:56:22,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110081041] [2024-11-10 09:56:22,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:22,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:56:22,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:56:22,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:56:22,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:56:22,044 INFO L87 Difference]: Start difference. First operand 195 states and 277 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 09:56:26,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:56:29,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:56:32,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:56:34,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:56:34,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:34,783 INFO L93 Difference]: Finished difference Result 389 states and 553 transitions. [2024-11-10 09:56:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:56:34,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2024-11-10 09:56:34,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:34,786 INFO L225 Difference]: With dead ends: 389 [2024-11-10 09:56:34,786 INFO L226 Difference]: Without dead ends: 197 [2024-11-10 09:56:34,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:56:34,787 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 95 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:34,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 389 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2024-11-10 09:56:34,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-10 09:56:34,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2024-11-10 09:56:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 178 states have (on average 1.3876404494382022) internal successors, (247), 178 states have internal predecessors, (247), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:56:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 275 transitions. [2024-11-10 09:56:34,794 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 275 transitions. Word has length 91 [2024-11-10 09:56:34,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:34,794 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 275 transitions. [2024-11-10 09:56:34,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 09:56:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 275 transitions. [2024-11-10 09:56:34,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 09:56:34,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:34,796 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:56:34,805 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 (7)] Ended with exit code 0 [2024-11-10 09:56:34,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 [2024-11-10 09:56:34,999 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:35,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:35,000 INFO L85 PathProgramCache]: Analyzing trace with hash -176202849, now seen corresponding path program 1 times [2024-11-10 09:56:35,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:56:35,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203515445] [2024-11-10 09:56:35,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:35,000 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 [2024-11-10 09:56:35,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:56:35,001 INFO L229 MonitoredProcess]: Starting monitored process 8 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) [2024-11-10 09:56:35,002 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 (8)] Waiting until timeout for monitored process [2024-11-10 09:56:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:35,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 09:56:35,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:56:35,974 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 [2024-11-10 09:56:36,627 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 34 treesize of output 18 [2024-11-10 09:56:36,933 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 34 treesize of output 18 [2024-11-10 09:56:37,166 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 27 treesize of output 15 [2024-11-10 09:56:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 09:56:37,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:56:37,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:56:37,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203515445] [2024-11-10 09:56:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203515445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:56:37,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [828174331] [2024-11-10 09:56:37,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:37,452 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 09:56:37,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 09:56:37,454 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 09:56:37,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-10 09:56:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:39,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 09:56:39,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:56:40,288 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 [2024-11-10 09:56:41,206 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 34 treesize of output 18 [2024-11-10 09:56:41,510 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 34 treesize of output 18 [2024-11-10 09:56:41,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-10 09:56:41,911 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 09:56:41,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:56:42,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [828174331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:56:42,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:56:42,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-11-10 09:56:42,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666973332] [2024-11-10 09:56:42,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 09:56:42,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 09:56:42,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:56:42,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 09:56:42,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2024-11-10 09:56:42,052 INFO L87 Difference]: Start difference. First operand 195 states and 275 transitions. Second operand has 23 states, 19 states have (on average 6.526315789473684) internal successors, (124), 20 states have internal predecessors, (124), 10 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-10 09:56:45,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:56:49,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []