./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-ap_file-36.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 f51706006ff06743eefcbd5d80b19f1348aeb761615f408f1eae1f3d293c89e8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:19:23,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:19:23,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:19:23,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:19:23,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:19:23,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:19:23,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:19:23,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:19:23,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:19:23,242 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:19:23,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:19:23,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:19:23,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:19:23,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:19:23,246 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:19:23,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:19:23,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:19:23,247 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:19:23,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:19:23,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:19:23,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:19:23,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:19:23,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:19:23,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:19:23,252 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:19:23,252 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:19:23,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:19:23,252 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:19:23,253 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:19:23,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:19:23,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:19:23,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:19:23,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:19:23,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:19:23,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:19:23,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:19:23,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:19:23,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:19:23,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:19:23,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:19:23,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:19:23,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:19:23,257 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 -> f51706006ff06743eefcbd5d80b19f1348aeb761615f408f1eae1f3d293c89e8 [2024-11-12 07:19:23,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:19:23,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:19:23,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:19:23,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:19:23,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:19:23,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-36.i [2024-11-12 07:19:24,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:19:25,159 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:19:25,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-36.i [2024-11-12 07:19:25,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f06231d90/f73a04410b294145b87140d474131239/FLAG5a3487c00 [2024-11-12 07:19:25,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f06231d90/f73a04410b294145b87140d474131239 [2024-11-12 07:19:25,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:19:25,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:19:25,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:19:25,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:19:25,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:19:25,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:19:25" (1/1) ... [2024-11-12 07:19:25,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c2aaa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:25, skipping insertion in model container [2024-11-12 07:19:25,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:19:25" (1/1) ... [2024-11-12 07:19:25,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:19:25,448 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-ap_file-36.i[917,930] [2024-11-12 07:19:25,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:19:25,562 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:19:25,574 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-ap_file-36.i[917,930] [2024-11-12 07:19:25,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:19:25,644 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:19:25,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:25 WrapperNode [2024-11-12 07:19:25,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:19:25,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:19:25,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:19:25,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:19:25,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:25" (1/1) ... [2024-11-12 07:19:25,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:25" (1/1) ... [2024-11-12 07:19:25,718 INFO L138 Inliner]: procedures = 29, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 570 [2024-11-12 07:19:25,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:19:25,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:19:25,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:19:25,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:19:25,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:25" (1/1) ... [2024-11-12 07:19:25,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:25" (1/1) ... [2024-11-12 07:19:25,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:25" (1/1) ... [2024-11-12 07:19:25,771 INFO L175 MemorySlicer]: Split 133 memory accesses to 6 slices as follows [2, 23, 61, 16, 22, 9]. 46 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 3, 4, 2, 2, 1]. The 18 writes are split as follows [0, 3, 5, 2, 4, 4]. [2024-11-12 07:19:25,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:25" (1/1) ... [2024-11-12 07:19:25,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:25" (1/1) ... [2024-11-12 07:19:25,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:25" (1/1) ... [2024-11-12 07:19:25,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:25" (1/1) ... [2024-11-12 07:19:25,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:25" (1/1) ... [2024-11-12 07:19:25,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:25" (1/1) ... [2024-11-12 07:19:25,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:19:25,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:19:25,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:19:25,829 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:19:25,830 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:25" (1/1) ... [2024-11-12 07:19:25,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:19:25,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:19:25,872 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-12 07:19:25,876 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-12 07:19:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:19:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-12 07:19:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-12 07:19:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-12 07:19:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-12 07:19:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-12 07:19:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-12 07:19:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:19:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:19:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 07:19:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 07:19:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 07:19:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 07:19:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-12 07:19:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-12 07:19:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-12 07:19:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-12 07:19:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-12 07:19:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-12 07:19:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:19:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:19:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 07:19:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 07:19:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 07:19:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 07:19:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-12 07:19:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-12 07:19:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-12 07:19:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-12 07:19:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-12 07:19:25,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-12 07:19:25,935 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:19:25,935 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:19:25,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:19:25,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:19:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 07:19:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 07:19:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 07:19:25,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 07:19:25,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:19:25,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:19:26,123 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:19:26,125 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:19:26,743 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-11-12 07:19:26,743 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:19:26,758 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:19:26,758 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:19:26,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:19:26 BoogieIcfgContainer [2024-11-12 07:19:26,759 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:19:26,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:19:26,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:19:26,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:19:26,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:19:25" (1/3) ... [2024-11-12 07:19:26,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac1eafa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:19:26, skipping insertion in model container [2024-11-12 07:19:26,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:25" (2/3) ... [2024-11-12 07:19:26,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac1eafa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:19:26, skipping insertion in model container [2024-11-12 07:19:26,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:19:26" (3/3) ... [2024-11-12 07:19:26,769 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-36.i [2024-11-12 07:19:26,788 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:19:26,788 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:19:26,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:19:26,863 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;@381508ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:19:26,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:19:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 110 states have internal predecessors, (162), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:19:26,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 07:19:26,886 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:26,888 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:26,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:26,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1589669722, now seen corresponding path program 1 times [2024-11-12 07:19:26,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:19:26,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824093410] [2024-11-12 07:19:26,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:26,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:19:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:19:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:19:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:19:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:19:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:19:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:19:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:19:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:19:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:19:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:19:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:19:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:27,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:19:27,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824093410] [2024-11-12 07:19:27,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824093410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:27,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:27,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:19:27,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573232584] [2024-11-12 07:19:27,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:27,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:19:27,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:19:27,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:19:27,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:19:27,488 INFO L87 Difference]: Start difference. First operand has 123 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 110 states have internal predecessors, (162), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:19:27,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:27,517 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2024-11-12 07:19:27,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:19:27,520 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-11-12 07:19:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:27,527 INFO L225 Difference]: With dead ends: 239 [2024-11-12 07:19:27,527 INFO L226 Difference]: Without dead ends: 119 [2024-11-12 07:19:27,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-12 07:19:27,534 INFO L435 NwaCegarLoop]: 177 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, 177 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-12 07:19:27,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:19:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-12 07:19:27,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-12 07:19:27,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 106 states have internal predecessors, (155), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:19:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2024-11-12 07:19:27,581 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 177 transitions. Word has length 109 [2024-11-12 07:19:27,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:27,582 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 177 transitions. [2024-11-12 07:19:27,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:19:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 177 transitions. [2024-11-12 07:19:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 07:19:27,586 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:27,586 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:27,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:19:27,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:27,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:27,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1423114536, now seen corresponding path program 1 times [2024-11-12 07:19:27,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:19:27,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552841463] [2024-11-12 07:19:27,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:27,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:19:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:19:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:19:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:19:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:19:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:19:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:19:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:19:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:19:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:19:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:19:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:19:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:27,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:19:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552841463] [2024-11-12 07:19:27,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552841463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:27,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:27,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:19:27,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41444902] [2024-11-12 07:19:27,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:27,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:19:27,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:19:27,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:19:27,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:19:27,966 INFO L87 Difference]: Start difference. First operand 119 states and 177 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:19:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:28,024 INFO L93 Difference]: Finished difference Result 237 states and 354 transitions. [2024-11-12 07:19:28,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:19:28,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-11-12 07:19:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:28,030 INFO L225 Difference]: With dead ends: 237 [2024-11-12 07:19:28,030 INFO L226 Difference]: Without dead ends: 121 [2024-11-12 07:19:28,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-12 07:19:28,034 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 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-12 07:19:28,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:19:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-12 07:19:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-12 07:19:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 108 states have (on average 1.4537037037037037) internal successors, (157), 108 states have internal predecessors, (157), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:19:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 179 transitions. [2024-11-12 07:19:28,054 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 179 transitions. Word has length 109 [2024-11-12 07:19:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:28,056 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 179 transitions. [2024-11-12 07:19:28,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:19:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 179 transitions. [2024-11-12 07:19:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 07:19:28,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:28,062 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:28,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:19:28,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:28,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:28,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2102386790, now seen corresponding path program 1 times [2024-11-12 07:19:28,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:19:28,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694589077] [2024-11-12 07:19:28,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:28,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:19:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:28,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:19:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:28,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:19:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:28,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:19:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:28,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:19:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:28,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:19:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:28,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:19:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:28,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:19:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:28,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:19:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:28,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:19:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:28,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:19:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:28,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:19:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:28,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:19:28,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694589077] [2024-11-12 07:19:28,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694589077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:28,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:28,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:19:28,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548578142] [2024-11-12 07:19:28,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:28,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:19:28,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:19:28,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:19:28,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:19:28,545 INFO L87 Difference]: Start difference. First operand 121 states and 179 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:28,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:28,711 INFO L93 Difference]: Finished difference Result 358 states and 532 transitions. [2024-11-12 07:19:28,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:19:28,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-11-12 07:19:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:28,713 INFO L225 Difference]: With dead ends: 358 [2024-11-12 07:19:28,714 INFO L226 Difference]: Without dead ends: 240 [2024-11-12 07:19:28,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:19:28,719 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 190 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:28,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 481 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:19:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-12 07:19:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 212. [2024-11-12 07:19:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 187 states have (on average 1.4491978609625669) internal successors, (271), 187 states have internal predecessors, (271), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 07:19:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 315 transitions. [2024-11-12 07:19:28,759 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 315 transitions. Word has length 109 [2024-11-12 07:19:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:28,760 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 315 transitions. [2024-11-12 07:19:28,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:28,761 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 315 transitions. [2024-11-12 07:19:28,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-12 07:19:28,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:28,765 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:28,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:19:28,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:28,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:28,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1598414197, now seen corresponding path program 1 times [2024-11-12 07:19:28,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:19:28,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362114116] [2024-11-12 07:19:28,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:28,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:19:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:19:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:19:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:19:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:19:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:19:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:19:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:19:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:19:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:19:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:19:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:19:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:29,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:19:29,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362114116] [2024-11-12 07:19:29,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362114116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:29,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:29,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:19:29,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313032851] [2024-11-12 07:19:29,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:29,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:19:29,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:19:29,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:19:29,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:19:29,388 INFO L87 Difference]: Start difference. First operand 212 states and 315 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:29,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:29,577 INFO L93 Difference]: Finished difference Result 566 states and 841 transitions. [2024-11-12 07:19:29,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:19:29,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-12 07:19:29,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:29,580 INFO L225 Difference]: With dead ends: 566 [2024-11-12 07:19:29,580 INFO L226 Difference]: Without dead ends: 448 [2024-11-12 07:19:29,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:19:29,586 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 272 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:29,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1207 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:19:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-12 07:19:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 349. [2024-11-12 07:19:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 314 states have (on average 1.464968152866242) internal successors, (460), 315 states have internal predecessors, (460), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 07:19:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 522 transitions. [2024-11-12 07:19:29,608 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 522 transitions. Word has length 110 [2024-11-12 07:19:29,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:29,609 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 522 transitions. [2024-11-12 07:19:29,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:29,610 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 522 transitions. [2024-11-12 07:19:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 07:19:29,611 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:29,611 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:29,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:19:29,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:29,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:29,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1255044309, now seen corresponding path program 1 times [2024-11-12 07:19:29,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:19:29,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666756426] [2024-11-12 07:19:29,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:29,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:19:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:19:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:19:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:19:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:19:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:19:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:19:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:19:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:19:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:19:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:19:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:19:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:29,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:19:29,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666756426] [2024-11-12 07:19:29,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666756426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:29,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:29,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:19:29,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427306493] [2024-11-12 07:19:29,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:29,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:19:29,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:19:29,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:19:29,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:19:29,715 INFO L87 Difference]: Start difference. First operand 349 states and 522 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:29,733 INFO L93 Difference]: Finished difference Result 601 states and 902 transitions. [2024-11-12 07:19:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:19:29,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-12 07:19:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:29,738 INFO L225 Difference]: With dead ends: 601 [2024-11-12 07:19:29,738 INFO L226 Difference]: Without dead ends: 351 [2024-11-12 07:19:29,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:19:29,740 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:29,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 346 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:19:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-12 07:19:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-11-12 07:19:29,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 316 states have (on average 1.4620253164556962) internal successors, (462), 317 states have internal predecessors, (462), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 07:19:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 524 transitions. [2024-11-12 07:19:29,764 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 524 transitions. Word has length 112 [2024-11-12 07:19:29,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:29,765 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 524 transitions. [2024-11-12 07:19:29,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 524 transitions. [2024-11-12 07:19:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 07:19:29,766 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:29,766 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:29,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:19:29,767 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:29,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:29,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1350979245, now seen corresponding path program 1 times [2024-11-12 07:19:29,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:19:29,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837352547] [2024-11-12 07:19:29,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:29,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:19:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:19:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:19:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:19:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:19:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:19:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:19:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:19:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:19:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:19:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:19:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:19:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:30,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:19:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837352547] [2024-11-12 07:19:30,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837352547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:30,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:30,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:19:30,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235772923] [2024-11-12 07:19:30,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:30,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:19:30,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:19:30,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:19:30,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:19:30,258 INFO L87 Difference]: Start difference. First operand 351 states and 524 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:30,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:30,385 INFO L93 Difference]: Finished difference Result 779 states and 1155 transitions. [2024-11-12 07:19:30,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:19:30,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-12 07:19:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:30,390 INFO L225 Difference]: With dead ends: 779 [2024-11-12 07:19:30,392 INFO L226 Difference]: Without dead ends: 554 [2024-11-12 07:19:30,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:19:30,393 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 130 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:30,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 645 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:19:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-12 07:19:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 355. [2024-11-12 07:19:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 319 states have (on average 1.457680250783699) internal successors, (465), 320 states have internal predecessors, (465), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 07:19:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 527 transitions. [2024-11-12 07:19:30,411 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 527 transitions. Word has length 112 [2024-11-12 07:19:30,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:30,411 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 527 transitions. [2024-11-12 07:19:30,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:30,412 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 527 transitions. [2024-11-12 07:19:30,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:19:30,413 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:30,413 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:30,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:19:30,413 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:30,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:30,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1392273823, now seen corresponding path program 1 times [2024-11-12 07:19:30,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:19:30,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530233086] [2024-11-12 07:19:30,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:30,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:19:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:19:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:19:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:19:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:19:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:19:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:19:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:19:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:19:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:19:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:19:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:19:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:30,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:19:30,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530233086] [2024-11-12 07:19:30,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530233086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:30,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:30,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:19:30,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980816647] [2024-11-12 07:19:30,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:30,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:19:30,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:19:30,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:19:30,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:19:30,680 INFO L87 Difference]: Start difference. First operand 355 states and 527 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:30,716 INFO L93 Difference]: Finished difference Result 586 states and 871 transitions. [2024-11-12 07:19:30,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:19:30,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 114 [2024-11-12 07:19:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:30,719 INFO L225 Difference]: With dead ends: 586 [2024-11-12 07:19:30,719 INFO L226 Difference]: Without dead ends: 361 [2024-11-12 07:19:30,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-12 07:19:30,720 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:30,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 679 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:19:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-12 07:19:30,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-11-12 07:19:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 325 states have (on average 1.4492307692307693) internal successors, (471), 326 states have internal predecessors, (471), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 07:19:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 533 transitions. [2024-11-12 07:19:30,735 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 533 transitions. Word has length 114 [2024-11-12 07:19:30,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:30,736 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 533 transitions. [2024-11-12 07:19:30,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 533 transitions. [2024-11-12 07:19:30,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:19:30,737 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:30,738 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:30,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:19:30,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:30,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash -815582044, now seen corresponding path program 1 times [2024-11-12 07:19:30,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:19:30,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158507116] [2024-11-12 07:19:30,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:30,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:19:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:19:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:19:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:19:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:19:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:19:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:19:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:19:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:19:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:19:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:19:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:19:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:31,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:19:31,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158507116] [2024-11-12 07:19:31,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158507116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:31,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:31,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:19:31,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486773248] [2024-11-12 07:19:31,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:31,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:19:31,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:19:31,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:19:31,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:19:31,069 INFO L87 Difference]: Start difference. First operand 361 states and 533 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:31,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:31,164 INFO L93 Difference]: Finished difference Result 664 states and 981 transitions. [2024-11-12 07:19:31,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:19:31,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 114 [2024-11-12 07:19:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:31,166 INFO L225 Difference]: With dead ends: 664 [2024-11-12 07:19:31,167 INFO L226 Difference]: Without dead ends: 415 [2024-11-12 07:19:31,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:19:31,168 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 46 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:31,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 680 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:19:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-12 07:19:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 375. [2024-11-12 07:19:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 339 states have (on average 1.448377581120944) internal successors, (491), 340 states have internal predecessors, (491), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 07:19:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 553 transitions. [2024-11-12 07:19:31,183 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 553 transitions. Word has length 114 [2024-11-12 07:19:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:31,183 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 553 transitions. [2024-11-12 07:19:31,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 553 transitions. [2024-11-12 07:19:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:19:31,185 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:31,185 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:31,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:19:31,185 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:31,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash 61356643, now seen corresponding path program 1 times [2024-11-12 07:19:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:19:31,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714813484] [2024-11-12 07:19:31,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:31,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:19:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:19:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:19:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:19:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:19:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:19:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:19:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:19:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:19:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:19:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:19:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:19:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:19:31,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714813484] [2024-11-12 07:19:31,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714813484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:31,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:31,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:19:31,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611934211] [2024-11-12 07:19:31,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:31,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:19:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:19:31,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:19:31,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:19:31,475 INFO L87 Difference]: Start difference. First operand 375 states and 553 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:31,570 INFO L93 Difference]: Finished difference Result 683 states and 1001 transitions. [2024-11-12 07:19:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:19:31,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 114 [2024-11-12 07:19:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:31,573 INFO L225 Difference]: With dead ends: 683 [2024-11-12 07:19:31,573 INFO L226 Difference]: Without dead ends: 437 [2024-11-12 07:19:31,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:19:31,575 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 124 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:31,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 544 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:19:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-12 07:19:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 379. [2024-11-12 07:19:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 343 states have (on average 1.4373177842565599) internal successors, (493), 344 states have internal predecessors, (493), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 07:19:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 555 transitions. [2024-11-12 07:19:31,589 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 555 transitions. Word has length 114 [2024-11-12 07:19:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:31,589 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 555 transitions. [2024-11-12 07:19:31,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 555 transitions. [2024-11-12 07:19:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:19:31,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:31,591 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:31,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:19:31,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:31,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash 319522081, now seen corresponding path program 1 times [2024-11-12 07:19:31,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:19:31,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006026072] [2024-11-12 07:19:31,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:31,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:19:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:19:31,655 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:19:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:19:31,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:19:31,804 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:19:31,805 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:19:31,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:19:31,810 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:31,958 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:19:31,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:19:31 BoogieIcfgContainer [2024-11-12 07:19:31,961 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:19:31,962 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:19:31,962 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:19:31,963 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:19:31,963 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:19:26" (3/4) ... [2024-11-12 07:19:31,965 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:19:31,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:19:31,967 INFO L158 Benchmark]: Toolchain (without parser) took 6774.09ms. Allocated memory was 161.5MB in the beginning and 283.1MB in the end (delta: 121.6MB). Free memory was 99.8MB in the beginning and 204.9MB in the end (delta: -105.1MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-11-12 07:19:31,967 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:19:31,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.94ms. Allocated memory is still 161.5MB. Free memory was 99.8MB in the beginning and 124.9MB in the end (delta: -25.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 07:19:31,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.26ms. Allocated memory is still 161.5MB. Free memory was 124.2MB in the beginning and 120.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:19:31,968 INFO L158 Benchmark]: Boogie Preprocessor took 104.96ms. Allocated memory is still 161.5MB. Free memory was 120.7MB in the beginning and 115.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:19:31,968 INFO L158 Benchmark]: RCFGBuilder took 930.22ms. Allocated memory is still 161.5MB. Free memory was 115.8MB in the beginning and 75.2MB in the end (delta: 40.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-12 07:19:31,968 INFO L158 Benchmark]: TraceAbstraction took 5198.87ms. Allocated memory was 161.5MB in the beginning and 283.1MB in the end (delta: 121.6MB). Free memory was 74.5MB in the beginning and 205.8MB in the end (delta: -131.3MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. [2024-11-12 07:19:31,969 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 283.1MB. Free memory is still 204.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:19:31,970 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.94ms. Allocated memory is still 161.5MB. Free memory was 99.8MB in the beginning and 124.9MB in the end (delta: -25.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.26ms. Allocated memory is still 161.5MB. Free memory was 124.2MB in the beginning and 120.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.96ms. Allocated memory is still 161.5MB. Free memory was 120.7MB in the beginning and 115.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 930.22ms. Allocated memory is still 161.5MB. Free memory was 115.8MB in the beginning and 75.2MB in the end (delta: 40.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5198.87ms. Allocated memory was 161.5MB in the beginning and 283.1MB in the end (delta: 121.6MB). Free memory was 74.5MB in the beginning and 205.8MB in the end (delta: -131.3MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 283.1MB. Free memory is still 204.9MB. 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 110, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of shiftRight at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 1, 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer = &(BOOL_unsigned_char_Array_0[2]); [L28-L30] double double_Array_0[2][2] = { {199.5, 64.2}, {3.5, 9.5} }; [L28-L30] double double_Array_0[2][2] = { {199.5, 64.2}, {3.5, 9.5} }; [L28-L30] double double_Array_0[2][2] = { {199.5, 64.2}, {3.5, 9.5} }; [L28-L30] double double_Array_0[2][2] = { {199.5, 64.2}, {3.5, 9.5} }; [L28-L30] double double_Array_0[2][2] = { {199.5, 64.2}, {3.5, 9.5} }; [L31] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0][0]); [L32] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1][0]); [L33] double* double_Array_0_arraydouble_Array_0arrayVar2_Pointer = &(double_Array_0[0][1]); [L34] double* double_Array_0_arraydouble_Array_0arrayVar3_Pointer = &(double_Array_0[1][1]); [L35-L37] float float_Array_0[2] = { 4.25, 9999999999.875 }; [L35-L37] float float_Array_0[2] = { 4.25, 9999999999.875 }; [L35-L37] float float_Array_0[2] = { 4.25, 9999999999.875 }; [L38] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L39] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L40-L42] unsigned char unsigned_char_Array_0[2] = { 2, 1 }; [L40-L42] unsigned char unsigned_char_Array_0[2] = { 2, 1 }; [L40-L42] unsigned char unsigned_char_Array_0[2] = { 2, 1 }; [L43] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L44] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L45-L47] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L45-L47] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L48] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer = &(unsigned_long_int_Array_0[0]); [L49] unsigned char last_1_unsigned_char_Array_0_1_ = 1; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=0, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L114] isInitial = 1 [L115] FCALL initially() [L116] COND TRUE 1 [L117] CALL updateLastVariables() [L107] EXPR unsigned_char_Array_0[1] [L107] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L117] RET updateLastVariables() [L118] CALL updateVariables() [L86] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L87] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L87] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L87] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L88] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L88] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L88] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L89] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L90] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L90] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L90] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L91] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L91] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L91] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L92] double_Array_0[0][0] = __VERIFIER_nondet_double() [L93] EXPR double_Array_0[0][0] [L93] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L93] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F [L93] EXPR double_Array_0[0][0] [L93] EXPR double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L93] EXPR (double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L93] EXPR (double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L93] CALL assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L93] RET assume_abort_if_not((double_Array_0[0][0] >= -922337.2036854765600e+13F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854765600e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L94] double_Array_0[1][0] = __VERIFIER_nondet_double() [L95] EXPR double_Array_0[1][0] [L95] EXPR double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L95] EXPR double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F [L95] EXPR double_Array_0[1][0] [L95] EXPR double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L95] EXPR (double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L95] EXPR (double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L95] CALL assume_abort_if_not((double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L95] RET assume_abort_if_not((double_Array_0[1][0] >= -922337.2036854765600e+13F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854765600e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L96] double_Array_0[1][1] = __VERIFIER_nondet_double() [L97] EXPR double_Array_0[1][1] [L97] EXPR double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L97] EXPR double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F [L97] EXPR double_Array_0[1][1] [L97] EXPR double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L97] EXPR (double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L97] EXPR (double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L97] CALL assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L97] RET assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854765600e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854765600e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L98] float_Array_0[0] = __VERIFIER_nondet_float() [L99] EXPR float_Array_0[0] [L99] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L99] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L99] EXPR float_Array_0[0] [L99] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L99] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L99] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L99] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L99] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L100] float_Array_0[1] = __VERIFIER_nondet_float() [L101] EXPR float_Array_0[1] [L101] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L101] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L101] EXPR float_Array_0[1] [L101] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L101] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L101] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L101] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L101] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L102] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L103] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L103] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L103] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L118] RET updateVariables() [L119] CALL step() [L53] EXPR last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_ VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L53] COND FALSE !((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) [L56] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L56] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L56] COND FALSE !((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == (- (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) [L63] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) = 0 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L65] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L65] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L65] COND TRUE (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) [L66] (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) = 4.6 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L70] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L70] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L70] unsigned char stepLocal_0 = (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) > (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)); [L71] stepLocal_0 && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L71] stepLocal_0 && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L71] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L71] stepLocal_0 && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L71] COND TRUE stepLocal_0 && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L72] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L72] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L72] EXPR (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) > ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))) [L72] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L72] EXPR (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) > ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L72] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L72] COND TRUE (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) > ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) != (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) [L73] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L73] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L74] (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) = 10u VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L119] RET step() [L120] CALL, EXPR property() [L110] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L110] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L110] EXPR ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) > (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L110] EXPR ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) > (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L110] EXPR (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) > (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) > ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) != (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) 10u)) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) [L110] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) [L110] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L110] EXPR (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) > (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) > ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) != (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) 10u)) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L110] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) > (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) > ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) != (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) 10u)) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L110] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) > (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) > ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) != (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) 10u)) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L110] EXPR (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) > (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) > ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) != (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) 10u)) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) 4.6)) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L110] EXPR (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) > (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) > ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) != (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) 10u)) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) 4.6)) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L110] EXPR ((((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) > (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) > ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) != (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) 10u)) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) 4.6)) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))))))))) && (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == (- (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) 0))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L110] EXPR ((((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) > (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) > ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) != (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) 10u)) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) 4.6)) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))))))))) && (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == (- (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) 0))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L110-L111] return ((((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) > (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) > ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((- (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) != (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) 10u)) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) && (((last_1_unsigned_char_Array_0_1_ >> last_1_unsigned_char_Array_0_1_) < (- last_1_unsigned_char_Array_0_1_)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) 4.6)) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))))))))) && (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) == (- (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) 0))) ; [L120] RET, EXPR property() [L120] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_unsigned_char_Array_0_1_=1, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 10, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 762 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 762 mSDsluCounter, 5273 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3583 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 394 IncrementalHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 1690 mSDtfsCounter, 394 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=379occurred in iteration=9, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 424 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1117 NumberOfCodeBlocks, 1117 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 994 ConstructedInterpolants, 0 QuantifiedInterpolants, 1318 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 1980/1980 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-12 07:19:32,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-ap_file-36.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 f51706006ff06743eefcbd5d80b19f1348aeb761615f408f1eae1f3d293c89e8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:19:34,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:19:34,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:19:34,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:19:34,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:19:34,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:19:34,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:19:34,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:19:34,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:19:34,484 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:19:34,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:19:34,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:19:34,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:19:34,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:19:34,490 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:19:34,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:19:34,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:19:34,491 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:19:34,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:19:34,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:19:34,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:19:34,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:19:34,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:19:34,493 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:19:34,493 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:19:34,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:19:34,494 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:19:34,494 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:19:34,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:19:34,494 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:19:34,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:19:34,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:19:34,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:19:34,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:19:34,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:19:34,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:19:34,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:19:34,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:19:34,497 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:19:34,497 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:19:34,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:19:34,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:19:34,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:19:34,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:19:34,499 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 -> f51706006ff06743eefcbd5d80b19f1348aeb761615f408f1eae1f3d293c89e8 [2024-11-12 07:19:34,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:19:34,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:19:34,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:19:34,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:19:34,829 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:19:34,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-36.i [2024-11-12 07:19:36,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:19:36,705 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:19:36,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-36.i [2024-11-12 07:19:36,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994bae265/667cc040861947b9ba62e67f7ec6bdc8/FLAGccaf8cb18 [2024-11-12 07:19:36,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994bae265/667cc040861947b9ba62e67f7ec6bdc8 [2024-11-12 07:19:36,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:19:36,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:19:36,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:19:36,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:19:36,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:19:36,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:19:36" (1/1) ... [2024-11-12 07:19:36,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5090ff97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:36, skipping insertion in model container [2024-11-12 07:19:36,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:19:36" (1/1) ... [2024-11-12 07:19:36,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:19:36,978 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-ap_file-36.i[917,930] [2024-11-12 07:19:37,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:19:37,096 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:19:37,110 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-ap_file-36.i[917,930] [2024-11-12 07:19:37,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:19:37,194 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:19:37,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:37 WrapperNode [2024-11-12 07:19:37,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:19:37,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:19:37,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:19:37,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:19:37,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:37" (1/1) ... [2024-11-12 07:19:37,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:37" (1/1) ... [2024-11-12 07:19:37,277 INFO L138 Inliner]: procedures = 36, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 556 [2024-11-12 07:19:37,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:19:37,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:19:37,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:19:37,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:19:37,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:37" (1/1) ... [2024-11-12 07:19:37,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:37" (1/1) ... [2024-11-12 07:19:37,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:37" (1/1) ... [2024-11-12 07:19:37,343 INFO L175 MemorySlicer]: Split 133 memory accesses to 6 slices as follows [2, 23, 61, 16, 22, 9]. 46 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 3, 4, 2, 2, 1]. The 18 writes are split as follows [0, 3, 5, 2, 4, 4]. [2024-11-12 07:19:37,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:37" (1/1) ... [2024-11-12 07:19:37,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:37" (1/1) ... [2024-11-12 07:19:37,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:37" (1/1) ... [2024-11-12 07:19:37,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:37" (1/1) ... [2024-11-12 07:19:37,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:37" (1/1) ... [2024-11-12 07:19:37,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:37" (1/1) ... [2024-11-12 07:19:37,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:19:37,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:19:37,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:19:37,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:19:37,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:37" (1/1) ... [2024-11-12 07:19:37,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:19:37,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:19:37,447 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-12 07:19:37,450 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-12 07:19:37,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:19:37,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-12 07:19:37,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-12 07:19:37,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-12 07:19:37,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-12 07:19:37,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-12 07:19:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-12 07:19:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-12 07:19:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-12 07:19:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-12 07:19:37,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-12 07:19:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-12 07:19:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-12 07:19:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:19:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:19:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 07:19:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-12 07:19:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-12 07:19:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-12 07:19:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:19:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:19:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 07:19:37,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-12 07:19:37,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-12 07:19:37,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-12 07:19:37,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-12 07:19:37,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-12 07:19:37,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-12 07:19:37,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-12 07:19:37,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-12 07:19:37,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-12 07:19:37,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:19:37,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:19:37,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-12 07:19:37,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-12 07:19:37,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-12 07:19:37,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-12 07:19:37,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-12 07:19:37,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-12 07:19:37,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-12 07:19:37,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-12 07:19:37,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-12 07:19:37,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-12 07:19:37,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:19:37,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:19:37,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-12 07:19:37,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-12 07:19:37,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-12 07:19:37,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-12 07:19:37,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:19:37,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:19:37,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-12 07:19:37,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-12 07:19:37,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-12 07:19:37,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-12 07:19:37,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-12 07:19:37,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-12 07:19:37,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-12 07:19:37,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-12 07:19:37,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-12 07:19:37,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-12 07:19:37,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:19:37,507 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:19:37,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:19:37,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:19:37,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:19:37,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:19:37,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-12 07:19:37,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-12 07:19:37,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-12 07:19:37,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-12 07:19:37,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:19:37,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:19:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-12 07:19:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-12 07:19:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-12 07:19:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-12 07:19:37,698 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:19:37,700 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:19:38,578 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2024-11-12 07:19:38,578 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:19:38,598 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:19:38,598 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:19:38,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:19:38 BoogieIcfgContainer [2024-11-12 07:19:38,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:19:38,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:19:38,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:19:38,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:19:38,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:19:36" (1/3) ... [2024-11-12 07:19:38,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e689d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:19:38, skipping insertion in model container [2024-11-12 07:19:38,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:19:37" (2/3) ... [2024-11-12 07:19:38,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e689d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:19:38, skipping insertion in model container [2024-11-12 07:19:38,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:19:38" (3/3) ... [2024-11-12 07:19:38,608 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-36.i [2024-11-12 07:19:38,625 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:19:38,625 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:19:38,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:19:38,711 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;@64f0cde9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:19:38,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:19:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 106 states have internal predecessors, (156), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:19:38,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 07:19:38,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:38,726 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:38,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:38,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:38,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1604184980, now seen corresponding path program 1 times [2024-11-12 07:19:38,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:19:38,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224916469] [2024-11-12 07:19:38,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:38,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:19:38,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:19:38,747 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-12 07:19:38,748 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-12 07:19:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:39,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:19:39,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:19:39,181 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-12 07:19:39,182 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:19:39,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:19:39,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224916469] [2024-11-12 07:19:39,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224916469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:39,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:39,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:19:39,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66264815] [2024-11-12 07:19:39,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:39,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:19:39,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:19:39,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:19:39,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:19:39,216 INFO L87 Difference]: Start difference. First operand has 119 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 106 states have internal predecessors, (156), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:19:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:39,242 INFO L93 Difference]: Finished difference Result 227 states and 355 transitions. [2024-11-12 07:19:39,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:19:39,245 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-12 07:19:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:39,254 INFO L225 Difference]: With dead ends: 227 [2024-11-12 07:19:39,255 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 07:19:39,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-12 07:19:39,265 INFO L435 NwaCegarLoop]: 163 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, 163 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-12 07:19:39,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:19:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 07:19:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-12 07:19:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 98 states have internal predecessors, (141), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:19:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-11-12 07:19:39,315 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 108 [2024-11-12 07:19:39,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:39,315 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-11-12 07:19:39,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:19:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-11-12 07:19:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 07:19:39,320 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:39,320 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:39,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 07:19:39,521 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-12 07:19:39,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:39,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1485217070, now seen corresponding path program 1 times [2024-11-12 07:19:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:19:39,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421814350] [2024-11-12 07:19:39,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:39,523 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-12 07:19:39,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:19:39,527 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-12 07:19:39,542 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-12 07:19:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:39,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:19:39,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:19:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-12 07:19:39,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:19:39,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:19:39,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421814350] [2024-11-12 07:19:39,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421814350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:39,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:39,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:19:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966178355] [2024-11-12 07:19:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:39,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:19:39,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:19:39,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:19:39,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:19:39,983 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:19:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:40,067 INFO L93 Difference]: Finished difference Result 221 states and 326 transitions. [2024-11-12 07:19:40,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:19:40,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-12 07:19:40,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:40,072 INFO L225 Difference]: With dead ends: 221 [2024-11-12 07:19:40,072 INFO L226 Difference]: Without dead ends: 113 [2024-11-12 07:19:40,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 105 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-12 07:19:40,074 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 472 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-12 07:19:40,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 472 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:19:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-12 07:19:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-12 07:19:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.43) internal successors, (143), 100 states have internal predecessors, (143), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:19:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2024-11-12 07:19:40,086 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 108 [2024-11-12 07:19:40,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:40,087 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2024-11-12 07:19:40,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:19:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2024-11-12 07:19:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 07:19:40,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:40,090 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:40,102 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-12 07:19:40,290 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-12 07:19:40,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:40,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash -476357588, now seen corresponding path program 1 times [2024-11-12 07:19:40,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:19:40,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234932645] [2024-11-12 07:19:40,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:40,293 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-12 07:19:40,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:19:40,296 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-12 07:19:40,297 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-12 07:19:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:40,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:19:40,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:19:40,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:19:40,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 64 [2024-11-12 07:19:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:40,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:19:40,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:19:40,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234932645] [2024-11-12 07:19:40,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234932645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:40,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:40,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:19:40,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507316529] [2024-11-12 07:19:40,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:40,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:19:40,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:19:40,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:19:40,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:19:40,882 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:40,903 INFO L93 Difference]: Finished difference Result 219 states and 320 transitions. [2024-11-12 07:19:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:19:40,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-12 07:19:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:40,906 INFO L225 Difference]: With dead ends: 219 [2024-11-12 07:19:40,906 INFO L226 Difference]: Without dead ends: 109 [2024-11-12 07:19:40,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:19:40,908 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:40,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 301 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:19:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-12 07:19:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-12 07:19:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:19:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2024-11-12 07:19:40,918 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 108 [2024-11-12 07:19:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:40,919 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2024-11-12 07:19:40,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2024-11-12 07:19:40,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 07:19:40,921 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:40,922 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:40,937 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-12 07:19:41,122 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-12 07:19:41,123 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:41,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1756221266, now seen corresponding path program 1 times [2024-11-12 07:19:41,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:19:41,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604253039] [2024-11-12 07:19:41,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:41,125 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-12 07:19:41,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:19:41,128 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-12 07:19:41,131 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-12 07:19:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:41,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 07:19:41,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:19:41,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-12 07:19:41,561 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 17 treesize of output 13 [2024-11-12 07:19:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:41,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:19:41,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:19:41,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604253039] [2024-11-12 07:19:41,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604253039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:41,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:41,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:19:41,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035566332] [2024-11-12 07:19:41,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:41,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:19:41,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:19:41,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:19:41,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:19:41,660 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:42,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:42,147 INFO L93 Difference]: Finished difference Result 313 states and 450 transitions. [2024-11-12 07:19:42,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:19:42,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-12 07:19:42,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:42,150 INFO L225 Difference]: With dead ends: 313 [2024-11-12 07:19:42,150 INFO L226 Difference]: Without dead ends: 207 [2024-11-12 07:19:42,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:19:42,152 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 130 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:42,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 913 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:19:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-12 07:19:42,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2024-11-12 07:19:42,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 181 states have (on average 1.4033149171270718) internal successors, (254), 182 states have internal predecessors, (254), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:19:42,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 294 transitions. [2024-11-12 07:19:42,173 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 294 transitions. Word has length 108 [2024-11-12 07:19:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:42,173 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 294 transitions. [2024-11-12 07:19:42,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 294 transitions. [2024-11-12 07:19:42,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-12 07:19:42,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:42,176 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:42,190 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-12 07:19:42,380 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-12 07:19:42,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:42,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:42,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1687701920, now seen corresponding path program 1 times [2024-11-12 07:19:42,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:19:42,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351838463] [2024-11-12 07:19:42,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:42,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:19:42,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:19:42,386 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-12 07:19:42,388 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-12 07:19:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:42,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:19:42,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:19:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:42,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:19:42,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:19:42,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351838463] [2024-11-12 07:19:42,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351838463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:42,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:42,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:19:42,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202198385] [2024-11-12 07:19:42,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:42,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:19:42,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:19:42,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:19:42,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:19:42,792 INFO L87 Difference]: Start difference. First operand 204 states and 294 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:42,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:42,835 INFO L93 Difference]: Finished difference Result 409 states and 591 transitions. [2024-11-12 07:19:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:19:42,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-12 07:19:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:42,839 INFO L225 Difference]: With dead ends: 409 [2024-11-12 07:19:42,839 INFO L226 Difference]: Without dead ends: 208 [2024-11-12 07:19:42,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 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-12 07:19:42,846 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 588 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-12 07:19:42,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 588 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:19:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-12 07:19:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-12 07:19:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.3945945945945946) internal successors, (258), 186 states have internal predecessors, (258), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:19:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 298 transitions. [2024-11-12 07:19:42,881 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 298 transitions. Word has length 110 [2024-11-12 07:19:42,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:42,882 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 298 transitions. [2024-11-12 07:19:42,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 298 transitions. [2024-11-12 07:19:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-12 07:19:42,886 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:42,886 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:42,900 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-12 07:19:43,086 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-12 07:19:43,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:43,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:43,088 INFO L85 PathProgramCache]: Analyzing trace with hash 517495110, now seen corresponding path program 1 times [2024-11-12 07:19:43,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:19:43,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487155563] [2024-11-12 07:19:43,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:43,088 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-12 07:19:43,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:19:43,090 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-12 07:19:43,091 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-12 07:19:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:43,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 07:19:43,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:19:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:43,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:19:43,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:19:43,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487155563] [2024-11-12 07:19:43,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487155563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:43,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:43,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:19:43,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477191412] [2024-11-12 07:19:43,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:43,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:19:43,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:19:43,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:19:43,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:19:43,496 INFO L87 Difference]: Start difference. First operand 208 states and 298 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:44,178 INFO L93 Difference]: Finished difference Result 464 states and 665 transitions. [2024-11-12 07:19:44,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:19:44,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-12 07:19:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:44,181 INFO L225 Difference]: With dead ends: 464 [2024-11-12 07:19:44,183 INFO L226 Difference]: Without dead ends: 259 [2024-11-12 07:19:44,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:19:44,185 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 63 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:44,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 685 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:19:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-12 07:19:44,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 222. [2024-11-12 07:19:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 199 states have (on average 1.3919597989949748) internal successors, (277), 200 states have internal predecessors, (277), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:19:44,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 317 transitions. [2024-11-12 07:19:44,202 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 317 transitions. Word has length 110 [2024-11-12 07:19:44,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:44,202 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 317 transitions. [2024-11-12 07:19:44,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:44,203 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 317 transitions. [2024-11-12 07:19:44,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-12 07:19:44,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:44,205 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:44,216 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 (7)] Forceful destruction successful, exit code 0 [2024-11-12 07:19:44,405 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-12 07:19:44,406 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:44,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:44,406 INFO L85 PathProgramCache]: Analyzing trace with hash 775660548, now seen corresponding path program 1 times [2024-11-12 07:19:44,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:19:44,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137181122] [2024-11-12 07:19:44,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:44,407 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-12 07:19:44,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:19:44,408 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-12 07:19:44,409 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-12 07:19:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:44,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 07:19:44,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:19:44,718 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 17 treesize of output 13 [2024-11-12 07:19:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:44,762 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:19:44,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:19:44,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137181122] [2024-11-12 07:19:44,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137181122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:44,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:44,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:19:44,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558924315] [2024-11-12 07:19:44,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:44,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:19:44,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:19:44,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:19:44,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:19:44,763 INFO L87 Difference]: Start difference. First operand 222 states and 317 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:45,308 INFO L93 Difference]: Finished difference Result 447 states and 637 transitions. [2024-11-12 07:19:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:19:45,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-11-12 07:19:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:45,312 INFO L225 Difference]: With dead ends: 447 [2024-11-12 07:19:45,312 INFO L226 Difference]: Without dead ends: 228 [2024-11-12 07:19:45,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:19:45,313 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 123 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:45,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 446 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:19:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-12 07:19:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 131. [2024-11-12 07:19:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 117 states have internal predecessors, (160), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:19:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2024-11-12 07:19:45,334 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 110 [2024-11-12 07:19:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:45,335 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2024-11-12 07:19:45,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2024-11-12 07:19:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 07:19:45,338 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:45,340 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:45,353 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 (8)] Ended with exit code 0 [2024-11-12 07:19:45,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-12 07:19:45,541 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:45,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:45,542 INFO L85 PathProgramCache]: Analyzing trace with hash 836656669, now seen corresponding path program 1 times [2024-11-12 07:19:45,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:19:45,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815858027] [2024-11-12 07:19:45,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:45,543 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-12 07:19:45,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:19:45,544 INFO L229 MonitoredProcess]: Starting monitored process 9 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-12 07:19:45,546 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 (9)] Waiting until timeout for monitored process [2024-11-12 07:19:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:45,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:19:45,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:19:45,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-12 07:19:45,872 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 17 treesize of output 13 [2024-11-12 07:19:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:45,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:19:45,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:19:45,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815858027] [2024-11-12 07:19:45,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815858027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:45,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:45,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:19:45,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084946245] [2024-11-12 07:19:45,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:45,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:19:45,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:19:45,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:19:45,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:19:45,968 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:46,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:46,621 INFO L93 Difference]: Finished difference Result 362 states and 507 transitions. [2024-11-12 07:19:46,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:19:46,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-12 07:19:46,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:46,624 INFO L225 Difference]: With dead ends: 362 [2024-11-12 07:19:46,624 INFO L226 Difference]: Without dead ends: 234 [2024-11-12 07:19:46,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:19:46,625 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 128 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:46,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1118 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:19:46,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-12 07:19:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 148. [2024-11-12 07:19:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 134 states have (on average 1.3805970149253732) internal successors, (185), 134 states have internal predecessors, (185), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:19:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2024-11-12 07:19:46,635 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 112 [2024-11-12 07:19:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:46,636 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2024-11-12 07:19:46,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2024-11-12 07:19:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 07:19:46,637 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:46,638 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:46,651 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 (9)] Forceful destruction successful, exit code 0 [2024-11-12 07:19:46,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-12 07:19:46,839 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:46,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:46,839 INFO L85 PathProgramCache]: Analyzing trace with hash 193989147, now seen corresponding path program 1 times [2024-11-12 07:19:46,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:19:46,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964394486] [2024-11-12 07:19:46,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:46,840 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-12 07:19:46,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:19:46,842 INFO L229 MonitoredProcess]: Starting monitored process 10 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-12 07:19:46,844 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 (10)] Waiting until timeout for monitored process [2024-11-12 07:19:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:47,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 07:19:47,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:19:47,434 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 21 treesize of output 10 [2024-11-12 07:19:47,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:19:47,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 66 [2024-11-12 07:19:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:47,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:19:47,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:19:47,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964394486] [2024-11-12 07:19:47,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964394486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:47,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:47,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:19:47,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336102421] [2024-11-12 07:19:47,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:47,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:19:47,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:19:47,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:19:47,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:19:47,540 INFO L87 Difference]: Start difference. First operand 148 states and 207 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:48,269 INFO L93 Difference]: Finished difference Result 335 states and 462 transitions. [2024-11-12 07:19:48,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:19:48,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-12 07:19:48,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:48,273 INFO L225 Difference]: With dead ends: 335 [2024-11-12 07:19:48,273 INFO L226 Difference]: Without dead ends: 190 [2024-11-12 07:19:48,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:19:48,275 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 167 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:48,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 341 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:19:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-12 07:19:48,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 151. [2024-11-12 07:19:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 132 states have (on average 1.303030303030303) internal successors, (172), 133 states have internal predecessors, (172), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:19:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 202 transitions. [2024-11-12 07:19:48,294 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 202 transitions. Word has length 112 [2024-11-12 07:19:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:48,295 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 202 transitions. [2024-11-12 07:19:48,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 202 transitions. [2024-11-12 07:19:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 07:19:48,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:48,296 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:48,307 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 (10)] Ended with exit code 0 [2024-11-12 07:19:48,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-12 07:19:48,497 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:48,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:48,498 INFO L85 PathProgramCache]: Analyzing trace with hash -827079207, now seen corresponding path program 1 times [2024-11-12 07:19:48,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:19:48,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61118253] [2024-11-12 07:19:48,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:48,499 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-12 07:19:48,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:19:48,502 INFO L229 MonitoredProcess]: Starting monitored process 11 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-12 07:19:48,503 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 (11)] Waiting until timeout for monitored process [2024-11-12 07:19:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:48,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:19:48,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:19:49,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:19:49,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-12 07:19:49,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:19:49,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 53 [2024-11-12 07:19:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:49,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:19:49,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:19:49,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61118253] [2024-11-12 07:19:49,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61118253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:49,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:49,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:19:49,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317300917] [2024-11-12 07:19:49,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:49,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:19:49,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:19:49,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:19:49,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:19:49,361 INFO L87 Difference]: Start difference. First operand 151 states and 202 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:50,080 INFO L93 Difference]: Finished difference Result 305 states and 407 transitions. [2024-11-12 07:19:50,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:19:50,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2024-11-12 07:19:50,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:50,083 INFO L225 Difference]: With dead ends: 305 [2024-11-12 07:19:50,083 INFO L226 Difference]: Without dead ends: 157 [2024-11-12 07:19:50,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:19:50,085 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 126 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:50,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 558 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:19:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-12 07:19:50,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2024-11-12 07:19:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.2962962962962963) internal successors, (175), 136 states have internal predecessors, (175), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:19:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 205 transitions. [2024-11-12 07:19:50,096 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 205 transitions. Word has length 112 [2024-11-12 07:19:50,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:50,097 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 205 transitions. [2024-11-12 07:19:50,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 205 transitions. [2024-11-12 07:19:50,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 07:19:50,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:50,098 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:50,110 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 (11)] Ended with exit code 0 [2024-11-12 07:19:50,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-12 07:19:50,299 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:50,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:50,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1518129061, now seen corresponding path program 1 times [2024-11-12 07:19:50,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:19:50,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143095256] [2024-11-12 07:19:50,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:50,301 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-12 07:19:50,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:19:50,302 INFO L229 MonitoredProcess]: Starting monitored process 12 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-12 07:19:50,303 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 (12)] Waiting until timeout for monitored process [2024-11-12 07:19:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:50,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:19:50,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:19:50,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-12 07:19:50,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-12 07:19:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:50,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:19:50,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:19:50,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143095256] [2024-11-12 07:19:50,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143095256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:19:50,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:19:50,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:19:50,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958388138] [2024-11-12 07:19:50,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:50,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:19:50,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:19:50,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:19:50,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:19:50,707 INFO L87 Difference]: Start difference. First operand 154 states and 205 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:50,864 INFO L93 Difference]: Finished difference Result 300 states and 399 transitions. [2024-11-12 07:19:50,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:19:50,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 114 [2024-11-12 07:19:50,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:50,867 INFO L225 Difference]: With dead ends: 300 [2024-11-12 07:19:50,867 INFO L226 Difference]: Without dead ends: 298 [2024-11-12 07:19:50,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:19:50,868 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 108 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:50,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1130 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:19:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-12 07:19:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2024-11-12 07:19:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 197 states have (on average 1.284263959390863) internal successors, (253), 198 states have internal predecessors, (253), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:19:50,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 283 transitions. [2024-11-12 07:19:50,898 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 283 transitions. Word has length 114 [2024-11-12 07:19:50,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:50,898 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 283 transitions. [2024-11-12 07:19:50,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 283 transitions. [2024-11-12 07:19:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 07:19:50,901 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:50,901 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:50,913 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 (12)] Forceful destruction successful, exit code 0 [2024-11-12 07:19:51,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-12 07:19:51,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:51,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash 740610255, now seen corresponding path program 1 times [2024-11-12 07:19:51,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:19:51,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7313171] [2024-11-12 07:19:51,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:51,103 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-12 07:19:51,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:19:51,104 INFO L229 MonitoredProcess]: Starting monitored process 13 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-12 07:19:51,105 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 (13)] Waiting until timeout for monitored process [2024-11-12 07:19:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:51,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 07:19:51,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:19:52,679 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-12 07:19:52,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 67 [2024-11-12 07:19:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-12 07:19:52,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:19:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:53,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:19:53,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7313171] [2024-11-12 07:19:53,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7313171] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:19:53,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:19:53,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-12 07:19:53,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496606430] [2024-11-12 07:19:53,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:53,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:19:53,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:19:53,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:19:53,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:19:53,036 INFO L87 Difference]: Start difference. First operand 216 states and 283 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:53,337 INFO L93 Difference]: Finished difference Result 443 states and 579 transitions. [2024-11-12 07:19:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:19:53,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 115 [2024-11-12 07:19:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:53,340 INFO L225 Difference]: With dead ends: 443 [2024-11-12 07:19:53,340 INFO L226 Difference]: Without dead ends: 230 [2024-11-12 07:19:53,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:19:53,342 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 68 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:53,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 626 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:19:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-12 07:19:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2024-11-12 07:19:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 204 states have (on average 1.2696078431372548) internal successors, (259), 205 states have internal predecessors, (259), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:19:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 295 transitions. [2024-11-12 07:19:53,358 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 295 transitions. Word has length 115 [2024-11-12 07:19:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:53,358 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 295 transitions. [2024-11-12 07:19:53,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 295 transitions. [2024-11-12 07:19:53,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 07:19:53,360 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:53,360 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:53,372 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 (13)] Ended with exit code 0 [2024-11-12 07:19:53,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-12 07:19:53,561 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:53,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:53,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1736939882, now seen corresponding path program 1 times [2024-11-12 07:19:53,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:19:53,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229176664] [2024-11-12 07:19:53,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:53,562 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-12 07:19:53,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:19:53,563 INFO L229 MonitoredProcess]: Starting monitored process 14 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-12 07:19:53,564 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 (14)] Waiting until timeout for monitored process [2024-11-12 07:19:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:53,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 07:19:53,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:19:54,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:19:54,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 71 [2024-11-12 07:19:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-12 07:19:55,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:19:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:19:55,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:19:55,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229176664] [2024-11-12 07:19:55,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229176664] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:19:55,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:19:55,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-12 07:19:55,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290669399] [2024-11-12 07:19:55,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:19:55,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:19:55,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:19:55,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:19:55,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:19:55,256 INFO L87 Difference]: Start difference. First operand 227 states and 295 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:19:55,502 INFO L93 Difference]: Finished difference Result 458 states and 592 transitions. [2024-11-12 07:19:55,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:19:55,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 115 [2024-11-12 07:19:55,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:19:55,505 INFO L225 Difference]: With dead ends: 458 [2024-11-12 07:19:55,505 INFO L226 Difference]: Without dead ends: 234 [2024-11-12 07:19:55,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:19:55,507 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 84 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:19:55,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 536 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:19:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-12 07:19:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2024-11-12 07:19:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 207 states have (on average 1.2560386473429952) internal successors, (260), 208 states have internal predecessors, (260), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 07:19:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 296 transitions. [2024-11-12 07:19:55,518 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 296 transitions. Word has length 115 [2024-11-12 07:19:55,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:19:55,519 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 296 transitions. [2024-11-12 07:19:55,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:19:55,519 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 296 transitions. [2024-11-12 07:19:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 07:19:55,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:19:55,522 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:19:55,536 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 (14)] Ended with exit code 0 [2024-11-12 07:19:55,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-12 07:19:55,723 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:19:55,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:19:55,723 INFO L85 PathProgramCache]: Analyzing trace with hash 125314621, now seen corresponding path program 1 times [2024-11-12 07:19:55,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:19:55,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13393223] [2024-11-12 07:19:55,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:19:55,724 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-12 07:19:55,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:19:55,726 INFO L229 MonitoredProcess]: Starting monitored process 15 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-12 07:19:55,727 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 (15)] Waiting until timeout for monitored process [2024-11-12 07:19:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:19:56,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 07:19:56,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:19:56,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 07:19:57,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 71 [2024-11-12 07:20:00,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 97 [2024-11-12 07:20:02,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:20:02,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 102 [2024-11-12 07:20:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 16 proven. 140 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 07:20:02,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:20:04,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:20:04,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13393223] [2024-11-12 07:20:04,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13393223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:20:04,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [761260914] [2024-11-12 07:20:04,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:20:04,996 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 07:20:04,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 07:20:04,997 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 07:20:05,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-12 07:20:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:20:06,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 07:20:06,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:20:07,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-12 07:20:10,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 51 [2024-11-12 07:20:14,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 97 [2024-11-12 07:20:18,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 94 [2024-11-12 07:20:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 16 proven. 140 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 07:20:22,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:20:31,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [761260914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:20:31,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:20:31,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2024-11-12 07:20:31,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845466812] [2024-11-12 07:20:31,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:20:31,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 07:20:31,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:20:31,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 07:20:31,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=661, Unknown=7, NotChecked=0, Total=756 [2024-11-12 07:20:31,334 INFO L87 Difference]: Start difference. First operand 231 states and 296 transitions. Second operand has 24 states, 24 states have (on average 5.0) internal successors, (120), 23 states have internal predecessors, (120), 8 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2024-11-12 07:20:36,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:20:40,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:20:52,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]