./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX --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 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 12:22:45,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:22:45,976 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 12:22:45,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:22:45,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:22:46,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:22:46,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:22:46,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:22:46,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:22:46,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:22:46,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:22:46,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:22:46,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:22:46,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:22:46,021 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:22:46,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:22:46,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:22:46,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:22:46,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:22:46,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:22:46,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:22:46,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:22:46,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:22:46,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:22:46,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:22:46,030 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:22:46,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:22:46,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:22:46,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:22:46,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:22:46,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:22:46,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:22:46,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:22:46,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:22:46,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:22:46,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:22:46,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:22:46,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:22:46,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:22:46,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:22:46,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:22:46,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:22:46,056 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX 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 -> 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 [2024-11-08 12:22:46,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:22:46,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:22:46,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:22:46,458 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:22:46,459 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:22:46,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i Unable to find full path for "g++" [2024-11-08 12:22:48,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:22:49,022 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:22:49,023 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2024-11-08 12:22:49,038 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/data/b48a3146c/9105be7f35924e86a2f25c911cc17f61/FLAGbde11fcf2 [2024-11-08 12:22:49,075 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/data/b48a3146c/9105be7f35924e86a2f25c911cc17f61 [2024-11-08 12:22:49,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:22:49,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:22:49,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:22:49,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:22:49,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:22:49,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:22:49" (1/1) ... [2024-11-08 12:22:49,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e6bae04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:49, skipping insertion in model container [2024-11-08 12:22:49,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:22:49" (1/1) ... [2024-11-08 12:22:49,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:22:49,469 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i[916,929] [2024-11-08 12:22:49,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:22:49,589 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:22:49,604 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i[916,929] [2024-11-08 12:22:49,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:22:49,712 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:22:49,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:49 WrapperNode [2024-11-08 12:22:49,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:22:49,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:22:49,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:22:49,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:22:49,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:49" (1/1) ... [2024-11-08 12:22:49,741 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:49" (1/1) ... [2024-11-08 12:22:49,795 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 523 [2024-11-08 12:22:49,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:22:49,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:22:49,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:22:49,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:22:49,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:49" (1/1) ... [2024-11-08 12:22:49,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:49" (1/1) ... [2024-11-08 12:22:49,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:49" (1/1) ... [2024-11-08 12:22:49,885 INFO L175 MemorySlicer]: Split 131 memory accesses to 4 slices as follows [2, 8, 31, 90]. 69 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 6]. The 15 writes are split as follows [0, 1, 5, 9]. [2024-11-08 12:22:49,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:49" (1/1) ... [2024-11-08 12:22:49,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:49" (1/1) ... [2024-11-08 12:22:49,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:49" (1/1) ... [2024-11-08 12:22:49,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:49" (1/1) ... [2024-11-08 12:22:49,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:49" (1/1) ... [2024-11-08 12:22:49,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:49" (1/1) ... [2024-11-08 12:22:49,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:22:49,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:22:49,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:22:49,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:22:49,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:49" (1/1) ... [2024-11-08 12:22:49,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:22:49,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:22:49,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 12:22:49,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 12:22:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:22:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 12:22:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 12:22:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 12:22:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 12:22:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 12:22:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 12:22:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 12:22:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 12:22:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 12:22:50,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 12:22:50,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 12:22:50,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 12:22:50,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 12:22:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 12:22:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 12:22:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 12:22:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 12:22:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 12:22:50,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 12:22:50,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 12:22:50,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 12:22:50,033 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 12:22:50,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 12:22:50,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 12:22:50,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 12:22:50,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 12:22:50,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:22:50,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:22:50,253 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:22:50,256 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:22:51,029 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-08 12:22:51,029 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:22:51,054 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:22:51,055 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 12:22:51,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:22:51 BoogieIcfgContainer [2024-11-08 12:22:51,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:22:51,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:22:51,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:22:51,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:22:51,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:22:49" (1/3) ... [2024-11-08 12:22:51,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4800013d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:22:51, skipping insertion in model container [2024-11-08 12:22:51,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:49" (2/3) ... [2024-11-08 12:22:51,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4800013d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:22:51, skipping insertion in model container [2024-11-08 12:22:51,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:22:51" (3/3) ... [2024-11-08 12:22:51,072 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-2.i [2024-11-08 12:22:51,095 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:22:51,095 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:22:51,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:22:51,187 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;@2eb01ea5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:22:51,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:22:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 12:22:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 12:22:51,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:22:51,234 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:22:51,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:22:51,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:51,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1658724944, now seen corresponding path program 1 times [2024-11-08 12:22:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:22:51,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501137978] [2024-11-08 12:22:51,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:22:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:51,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:22:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:51,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:22:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:51,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:22:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:51,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:22:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:51,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:22:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:51,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:22:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:51,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:22:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:51,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:22:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:51,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:22:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:51,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:22:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:51,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:22:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:51,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:22:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:22:51,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:22:51,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501137978] [2024-11-08 12:22:51,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501137978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:22:51,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:22:51,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:22:51,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654945241] [2024-11-08 12:22:51,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:22:51,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:22:51,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:22:51,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:22:51,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:22:51,857 INFO L87 Difference]: Start difference. First operand has 104 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 12:22:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:22:51,906 INFO L93 Difference]: Finished difference Result 201 states and 314 transitions. [2024-11-08 12:22:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:22:51,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-08 12:22:51,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:22:51,919 INFO L225 Difference]: With dead ends: 201 [2024-11-08 12:22:51,919 INFO L226 Difference]: Without dead ends: 100 [2024-11-08 12:22:51,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-08 12:22:51,928 INFO L432 NwaCegarLoop]: 147 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, 147 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-08 12:22:51,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:22:51,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-08 12:22:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-08 12:22:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.430232558139535) internal successors, (123), 86 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 12:22:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2024-11-08 12:22:52,000 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 100 [2024-11-08 12:22:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:22:52,001 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2024-11-08 12:22:52,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 12:22:52,002 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2024-11-08 12:22:52,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 12:22:52,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:22:52,007 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:22:52,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:22:52,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:22:52,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:52,009 INFO L85 PathProgramCache]: Analyzing trace with hash 671944228, now seen corresponding path program 1 times [2024-11-08 12:22:52,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:22:52,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928293754] [2024-11-08 12:22:52,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:52,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:22:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:22:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:22:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:22:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:22:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:22:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:22:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:22:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:22:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:22:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:22:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:22:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:22:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,369 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:22:52,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:22:52,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928293754] [2024-11-08 12:22:52,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928293754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:22:52,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:22:52,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:22:52,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575516595] [2024-11-08 12:22:52,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:22:52,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:22:52,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:22:52,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:22:52,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:22:52,377 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:22:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:22:52,437 INFO L93 Difference]: Finished difference Result 198 states and 293 transitions. [2024-11-08 12:22:52,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:22:52,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-08 12:22:52,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:22:52,440 INFO L225 Difference]: With dead ends: 198 [2024-11-08 12:22:52,441 INFO L226 Difference]: Without dead ends: 101 [2024-11-08 12:22:52,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-08 12:22:52,443 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 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-08 12:22:52,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:22:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-08 12:22:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-08 12:22:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 87 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 12:22:52,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions. [2024-11-08 12:22:52,467 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 100 [2024-11-08 12:22:52,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:22:52,470 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 148 transitions. [2024-11-08 12:22:52,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:22:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions. [2024-11-08 12:22:52,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 12:22:52,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:22:52,478 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:22:52,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 12:22:52,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:22:52,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:52,481 INFO L85 PathProgramCache]: Analyzing trace with hash -339173022, now seen corresponding path program 1 times [2024-11-08 12:22:52,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:22:52,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914173567] [2024-11-08 12:22:52,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:52,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:22:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:22:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:22:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:22:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:22:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:22:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:22:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:22:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:22:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:22:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:22:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:22:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:22:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:22:52,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:22:52,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914173567] [2024-11-08 12:22:52,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914173567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:22:52,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:22:52,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:22:52,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799725150] [2024-11-08 12:22:52,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:22:52,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:22:52,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:22:52,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:22:52,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:22:52,936 INFO L87 Difference]: Start difference. First operand 101 states and 148 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:22:52,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:22:53,002 INFO L93 Difference]: Finished difference Result 201 states and 296 transitions. [2024-11-08 12:22:53,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:22:53,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-08 12:22:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:22:53,005 INFO L225 Difference]: With dead ends: 201 [2024-11-08 12:22:53,006 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 12:22:53,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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-08 12:22:53,011 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 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-08 12:22:53,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:22:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 12:22:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-08 12:22:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 89 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 12:22:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-11-08 12:22:53,023 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 100 [2024-11-08 12:22:53,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:22:53,024 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-11-08 12:22:53,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:22:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-11-08 12:22:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 12:22:53,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:22:53,027 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:22:53,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 12:22:53,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:22:53,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash 619177501, now seen corresponding path program 1 times [2024-11-08 12:22:53,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:22:53,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612207616] [2024-11-08 12:22:53,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:53,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:22:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:22:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:22:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:22:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:22:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:22:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:22:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:22:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:22:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:22:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:22:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:22:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:22:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:22:53,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:22:53,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612207616] [2024-11-08 12:22:53,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612207616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:22:53,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:22:53,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:22:53,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843851279] [2024-11-08 12:22:53,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:22:53,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:22:53,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:22:53,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:22:53,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:22:53,326 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:22:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:22:53,408 INFO L93 Difference]: Finished difference Result 248 states and 364 transitions. [2024-11-08 12:22:53,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:22:53,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-08 12:22:53,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:22:53,411 INFO L225 Difference]: With dead ends: 248 [2024-11-08 12:22:53,411 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 12:22:53,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-08 12:22:53,415 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 60 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:22:53,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 288 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:22:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 12:22:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 121. [2024-11-08 12:22:53,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 107 states have (on average 1.439252336448598) internal successors, (154), 107 states have internal predecessors, (154), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 12:22:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2024-11-08 12:22:53,434 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 103 [2024-11-08 12:22:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:22:53,435 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2024-11-08 12:22:53,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:22:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2024-11-08 12:22:53,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 12:22:53,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:22:53,442 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:22:53,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 12:22:53,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:22:53,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:53,443 INFO L85 PathProgramCache]: Analyzing trace with hash 221316002, now seen corresponding path program 1 times [2024-11-08 12:22:53,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:22:53,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062300832] [2024-11-08 12:22:53,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:53,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:22:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:22:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:22:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:22:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:22:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:22:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:22:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:22:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:22:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:22:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:22:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:22:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:22:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:22:53,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:22:53,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062300832] [2024-11-08 12:22:53,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062300832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:22:53,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:22:53,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:22:53,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920163966] [2024-11-08 12:22:53,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:22:53,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:22:53,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:22:53,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:22:53,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:22:53,677 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:22:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:22:53,719 INFO L93 Difference]: Finished difference Result 240 states and 355 transitions. [2024-11-08 12:22:53,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:22:53,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-08 12:22:53,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:22:53,722 INFO L225 Difference]: With dead ends: 240 [2024-11-08 12:22:53,722 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 12:22:53,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-08 12:22:53,728 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:22:53,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:22:53,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 12:22:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-08 12:22:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 108 states have internal predecessors, (155), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 12:22:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 179 transitions. [2024-11-08 12:22:53,751 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 179 transitions. Word has length 103 [2024-11-08 12:22:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:22:53,752 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 179 transitions. [2024-11-08 12:22:53,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:22:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2024-11-08 12:22:53,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 12:22:53,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:22:53,758 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:22:53,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 12:22:53,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:22:53,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:53,759 INFO L85 PathProgramCache]: Analyzing trace with hash 901374372, now seen corresponding path program 1 times [2024-11-08 12:22:53,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:22:53,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489169084] [2024-11-08 12:22:53,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:53,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:22:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:55,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:22:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:55,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:22:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:55,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:22:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:55,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:22:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:55,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:22:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:55,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:22:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:55,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:22:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:55,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:22:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:55,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:22:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:55,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:22:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:55,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:22:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:55,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:22:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:22:55,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:22:55,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489169084] [2024-11-08 12:22:55,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489169084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:22:55,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:22:55,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 12:22:55,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718953626] [2024-11-08 12:22:55,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:22:55,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 12:22:55,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:22:55,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 12:22:55,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 12:22:55,282 INFO L87 Difference]: Start difference. First operand 122 states and 179 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:22:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:22:56,014 INFO L93 Difference]: Finished difference Result 318 states and 464 transitions. [2024-11-08 12:22:56,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:22:56,014 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-08 12:22:56,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:22:56,017 INFO L225 Difference]: With dead ends: 318 [2024-11-08 12:22:56,017 INFO L226 Difference]: Without dead ends: 199 [2024-11-08 12:22:56,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-08 12:22:56,019 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 248 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 12:22:56,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1012 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 12:22:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-08 12:22:56,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2024-11-08 12:22:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 177 states have (on average 1.4293785310734464) internal successors, (253), 178 states have internal predecessors, (253), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 12:22:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 285 transitions. [2024-11-08 12:22:56,045 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 285 transitions. Word has length 103 [2024-11-08 12:22:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:22:56,046 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 285 transitions. [2024-11-08 12:22:56,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:22:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 285 transitions. [2024-11-08 12:22:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 12:22:56,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:22:56,048 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:22:56,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 12:22:56,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:22:56,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash -477830865, now seen corresponding path program 1 times [2024-11-08 12:22:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:22:56,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105479258] [2024-11-08 12:22:56,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:56,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:22:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 12:22:56,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401954987] [2024-11-08 12:22:56,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:56,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:22:56,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:22:56,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:22:56,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 12:22:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:56,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 12:22:56,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:22:57,124 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:22:57,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:22:57,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:22:57,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105479258] [2024-11-08 12:22:57,125 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 12:22:57,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401954987] [2024-11-08 12:22:57,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401954987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:22:57,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:22:57,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:22:57,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696609582] [2024-11-08 12:22:57,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:22:57,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:22:57,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:22:57,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:22:57,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:22:57,128 INFO L87 Difference]: Start difference. First operand 196 states and 285 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:22:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:22:57,403 INFO L93 Difference]: Finished difference Result 532 states and 777 transitions. [2024-11-08 12:22:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:22:57,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-08 12:22:57,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:22:57,408 INFO L225 Difference]: With dead ends: 532 [2024-11-08 12:22:57,408 INFO L226 Difference]: Without dead ends: 339 [2024-11-08 12:22:57,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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-08 12:22:57,410 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 134 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 12:22:57,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 366 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 12:22:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-08 12:22:57,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 268. [2024-11-08 12:22:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 236 states have (on average 1.4152542372881356) internal successors, (334), 237 states have internal predecessors, (334), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:22:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 390 transitions. [2024-11-08 12:22:57,437 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 390 transitions. Word has length 105 [2024-11-08 12:22:57,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:22:57,438 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 390 transitions. [2024-11-08 12:22:57,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:22:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 390 transitions. [2024-11-08 12:22:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 12:22:57,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:22:57,440 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:22:57,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 12:22:57,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 12:22:57,642 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:22:57,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1311623562, now seen corresponding path program 1 times [2024-11-08 12:22:57,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:22:57,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511233068] [2024-11-08 12:22:57,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:57,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:22:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:58,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:22:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:58,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:22:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:58,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:22:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:58,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:22:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:58,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:22:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:58,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:22:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:58,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:22:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:58,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:22:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:22:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:58,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:22:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:58,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:22:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:58,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:22:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:22:58,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:22:58,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511233068] [2024-11-08 12:22:58,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511233068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:22:58,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:22:58,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:22:58,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229730681] [2024-11-08 12:22:58,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:22:58,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:22:58,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:22:58,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:22:58,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:22:58,183 INFO L87 Difference]: Start difference. First operand 268 states and 390 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:22:58,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:22:58,538 INFO L93 Difference]: Finished difference Result 593 states and 855 transitions. [2024-11-08 12:22:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:22:58,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-08 12:22:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:22:58,543 INFO L225 Difference]: With dead ends: 593 [2024-11-08 12:22:58,543 INFO L226 Difference]: Without dead ends: 400 [2024-11-08 12:22:58,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:22:58,547 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 81 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:22:58,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 533 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 12:22:58,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-08 12:22:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 290. [2024-11-08 12:22:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 258 states have (on average 1.4069767441860466) internal successors, (363), 259 states have internal predecessors, (363), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:22:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 419 transitions. [2024-11-08 12:22:58,583 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 419 transitions. Word has length 106 [2024-11-08 12:22:58,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:22:58,583 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 419 transitions. [2024-11-08 12:22:58,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:22:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 419 transitions. [2024-11-08 12:22:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 12:22:58,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:22:58,585 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:22:58,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 12:22:58,586 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:22:58,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:58,586 INFO L85 PathProgramCache]: Analyzing trace with hash -610558984, now seen corresponding path program 1 times [2024-11-08 12:22:58,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:22:58,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122349040] [2024-11-08 12:22:58,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:58,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:22:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:00,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:23:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:00,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:23:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:00,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:23:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:00,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:23:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:00,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:23:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:00,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:23:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:00,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:23:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:00,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:23:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:00,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:23:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:00,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:23:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:00,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:23:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:00,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:23:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:23:01,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:01,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122349040] [2024-11-08 12:23:01,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122349040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:01,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:01,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 12:23:01,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334533239] [2024-11-08 12:23:01,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:01,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 12:23:01,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:01,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 12:23:01,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 12:23:01,015 INFO L87 Difference]: Start difference. First operand 290 states and 419 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:02,247 INFO L93 Difference]: Finished difference Result 702 states and 1014 transitions. [2024-11-08 12:23:02,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:23:02,248 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-08 12:23:02,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:02,252 INFO L225 Difference]: With dead ends: 702 [2024-11-08 12:23:02,252 INFO L226 Difference]: Without dead ends: 491 [2024-11-08 12:23:02,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-08 12:23:02,254 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 215 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:02,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 984 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 12:23:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-08 12:23:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 358. [2024-11-08 12:23:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 326 states have (on average 1.4263803680981595) internal successors, (465), 327 states have internal predecessors, (465), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:23:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 521 transitions. [2024-11-08 12:23:02,296 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 521 transitions. Word has length 106 [2024-11-08 12:23:02,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:02,297 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 521 transitions. [2024-11-08 12:23:02,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 521 transitions. [2024-11-08 12:23:02,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 12:23:02,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:02,299 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:02,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 12:23:02,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:02,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:02,300 INFO L85 PathProgramCache]: Analyzing trace with hash -372608046, now seen corresponding path program 1 times [2024-11-08 12:23:02,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:02,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909619806] [2024-11-08 12:23:02,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:02,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:02,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:23:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:02,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:23:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:02,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:23:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:02,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:23:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:02,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:23:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:02,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:23:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:02,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:23:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:02,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:23:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:02,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:23:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:02,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:23:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:02,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:23:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:02,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:23:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:23:02,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:02,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909619806] [2024-11-08 12:23:02,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909619806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:02,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:02,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:23:02,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669024695] [2024-11-08 12:23:02,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:02,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:23:02,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:02,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:23:02,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:23:02,797 INFO L87 Difference]: Start difference. First operand 358 states and 521 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:03,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:03,158 INFO L93 Difference]: Finished difference Result 684 states and 993 transitions. [2024-11-08 12:23:03,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:23:03,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-08 12:23:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:03,163 INFO L225 Difference]: With dead ends: 684 [2024-11-08 12:23:03,163 INFO L226 Difference]: Without dead ends: 435 [2024-11-08 12:23:03,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:23:03,165 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 78 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:03,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 535 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 12:23:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-08 12:23:03,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 363. [2024-11-08 12:23:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 331 states have (on average 1.4290030211480362) internal successors, (473), 332 states have internal predecessors, (473), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:23:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 529 transitions. [2024-11-08 12:23:03,204 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 529 transitions. Word has length 108 [2024-11-08 12:23:03,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:03,205 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 529 transitions. [2024-11-08 12:23:03,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 529 transitions. [2024-11-08 12:23:03,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 12:23:03,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:03,208 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:03,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 12:23:03,208 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:03,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:03,209 INFO L85 PathProgramCache]: Analyzing trace with hash 328456532, now seen corresponding path program 1 times [2024-11-08 12:23:03,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:03,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917720245] [2024-11-08 12:23:03,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:03,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:04,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:23:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:04,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:23:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:05,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:23:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:05,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:23:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:05,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:23:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:05,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:23:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:05,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:23:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:23:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:05,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:23:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:05,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:23:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:05,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:23:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:05,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:23:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:23:05,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:05,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917720245] [2024-11-08 12:23:05,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917720245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:05,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:05,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 12:23:05,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014914541] [2024-11-08 12:23:05,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:05,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 12:23:05,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:05,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 12:23:05,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 12:23:05,139 INFO L87 Difference]: Start difference. First operand 363 states and 529 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 12:23:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:06,461 INFO L93 Difference]: Finished difference Result 765 states and 1116 transitions. [2024-11-08 12:23:06,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:23:06,462 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-11-08 12:23:06,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:06,466 INFO L225 Difference]: With dead ends: 765 [2024-11-08 12:23:06,466 INFO L226 Difference]: Without dead ends: 511 [2024-11-08 12:23:06,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-08 12:23:06,467 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 478 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:06,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 663 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 12:23:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-08 12:23:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 435. [2024-11-08 12:23:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 402 states have (on average 1.4378109452736318) internal successors, (578), 403 states have internal predecessors, (578), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:23:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 634 transitions. [2024-11-08 12:23:06,516 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 634 transitions. Word has length 108 [2024-11-08 12:23:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:06,517 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 634 transitions. [2024-11-08 12:23:06,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 12:23:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 634 transitions. [2024-11-08 12:23:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 12:23:06,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:06,520 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:06,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 12:23:06,521 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:06,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:06,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1171004910, now seen corresponding path program 1 times [2024-11-08 12:23:06,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:06,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722273097] [2024-11-08 12:23:06,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:07,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:23:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:07,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:23:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:07,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:23:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:07,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:23:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:07,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:23:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:07,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:23:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:07,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:23:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:07,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:23:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:23:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:07,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:23:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:07,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:23:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:07,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:23:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:23:07,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:07,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722273097] [2024-11-08 12:23:07,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722273097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:07,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:07,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:23:07,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445709759] [2024-11-08 12:23:07,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:07,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:23:07,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:07,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:23:07,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:23:07,092 INFO L87 Difference]: Start difference. First operand 435 states and 634 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:07,390 INFO L93 Difference]: Finished difference Result 763 states and 1117 transitions. [2024-11-08 12:23:07,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:23:07,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-08 12:23:07,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:07,394 INFO L225 Difference]: With dead ends: 763 [2024-11-08 12:23:07,394 INFO L226 Difference]: Without dead ends: 441 [2024-11-08 12:23:07,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:23:07,396 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 4 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:07,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 477 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 12:23:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-08 12:23:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 437. [2024-11-08 12:23:07,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 404 states have (on average 1.4356435643564356) internal successors, (580), 405 states have internal predecessors, (580), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:23:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 636 transitions. [2024-11-08 12:23:07,442 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 636 transitions. Word has length 108 [2024-11-08 12:23:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:07,443 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 636 transitions. [2024-11-08 12:23:07,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 636 transitions. [2024-11-08 12:23:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 12:23:07,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:07,445 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:07,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 12:23:07,446 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:07,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:07,446 INFO L85 PathProgramCache]: Analyzing trace with hash -748303084, now seen corresponding path program 1 times [2024-11-08 12:23:07,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:07,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959031880] [2024-11-08 12:23:07,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:07,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:09,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:23:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:09,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:23:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:09,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:23:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:09,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:23:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:09,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:23:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:09,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:23:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:09,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:23:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:09,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:23:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:09,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:23:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:09,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:23:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:09,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:23:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:09,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:23:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:23:09,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:09,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959031880] [2024-11-08 12:23:09,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959031880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:09,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:09,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 12:23:09,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879014404] [2024-11-08 12:23:09,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:09,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 12:23:09,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:09,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 12:23:09,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 12:23:09,376 INFO L87 Difference]: Start difference. First operand 437 states and 636 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 12:23:10,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:10,773 INFO L93 Difference]: Finished difference Result 927 states and 1352 transitions. [2024-11-08 12:23:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:23:10,774 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-11-08 12:23:10,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:10,778 INFO L225 Difference]: With dead ends: 927 [2024-11-08 12:23:10,778 INFO L226 Difference]: Without dead ends: 635 [2024-11-08 12:23:10,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-08 12:23:10,781 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 216 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:10,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 939 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 12:23:10,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-08 12:23:10,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 508. [2024-11-08 12:23:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 475 states have (on average 1.44) internal successors, (684), 476 states have internal predecessors, (684), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:23:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 740 transitions. [2024-11-08 12:23:10,833 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 740 transitions. Word has length 108 [2024-11-08 12:23:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:10,833 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 740 transitions. [2024-11-08 12:23:10,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 12:23:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 740 transitions. [2024-11-08 12:23:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 12:23:10,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:10,836 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:10,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 12:23:10,837 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:10,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:10,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2133894866, now seen corresponding path program 1 times [2024-11-08 12:23:10,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:10,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244815673] [2024-11-08 12:23:10,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:10,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:12,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:23:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:12,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:23:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:23:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:13,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:23:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:13,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:23:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:13,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:23:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:13,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:23:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:13,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:23:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:13,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:23:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:13,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:23:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:13,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:23:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:13,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:23:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:23:13,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:13,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244815673] [2024-11-08 12:23:13,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244815673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:13,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:13,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 12:23:13,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256223985] [2024-11-08 12:23:13,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:13,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 12:23:13,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:13,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 12:23:13,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 12:23:13,088 INFO L87 Difference]: Start difference. First operand 508 states and 740 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 12:23:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:14,205 INFO L93 Difference]: Finished difference Result 896 states and 1308 transitions. [2024-11-08 12:23:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:23:14,206 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-08 12:23:14,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:14,209 INFO L225 Difference]: With dead ends: 896 [2024-11-08 12:23:14,209 INFO L226 Difference]: Without dead ends: 560 [2024-11-08 12:23:14,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-08 12:23:14,211 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 329 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:14,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 689 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 12:23:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-08 12:23:14,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 496. [2024-11-08 12:23:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 463 states have (on average 1.4341252699784017) internal successors, (664), 464 states have internal predecessors, (664), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:23:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 720 transitions. [2024-11-08 12:23:14,278 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 720 transitions. Word has length 108 [2024-11-08 12:23:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:14,279 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 720 transitions. [2024-11-08 12:23:14,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 12:23:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 720 transitions. [2024-11-08 12:23:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 12:23:14,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:14,282 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:14,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 12:23:14,282 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:14,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash -295289682, now seen corresponding path program 1 times [2024-11-08 12:23:14,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:14,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957629771] [2024-11-08 12:23:14,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:14,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:15,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:23:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:15,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:23:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:15,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:23:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:15,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:23:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:15,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:23:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:15,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:23:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:15,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:23:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:15,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:23:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:15,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:23:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:15,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:23:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:15,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:23:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:15,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:23:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:23:15,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:15,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957629771] [2024-11-08 12:23:15,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957629771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:15,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:15,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 12:23:15,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294117078] [2024-11-08 12:23:15,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:15,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 12:23:15,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:15,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 12:23:15,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 12:23:15,270 INFO L87 Difference]: Start difference. First operand 496 states and 720 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:16,370 INFO L93 Difference]: Finished difference Result 957 states and 1385 transitions. [2024-11-08 12:23:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:23:16,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-08 12:23:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:16,378 INFO L225 Difference]: With dead ends: 957 [2024-11-08 12:23:16,378 INFO L226 Difference]: Without dead ends: 633 [2024-11-08 12:23:16,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-08 12:23:16,380 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 367 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:16,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 739 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 12:23:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-08 12:23:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 511. [2024-11-08 12:23:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 478 states have (on average 1.4267782426778242) internal successors, (682), 479 states have internal predecessors, (682), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:23:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 738 transitions. [2024-11-08 12:23:16,442 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 738 transitions. Word has length 109 [2024-11-08 12:23:16,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:16,443 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 738 transitions. [2024-11-08 12:23:16,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 738 transitions. [2024-11-08 12:23:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 12:23:16,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:16,445 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:16,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 12:23:16,446 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:16,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:16,446 INFO L85 PathProgramCache]: Analyzing trace with hash -748082190, now seen corresponding path program 1 times [2024-11-08 12:23:16,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:16,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964436816] [2024-11-08 12:23:16,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:16,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:17,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:23:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:17,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:23:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:17,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:23:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:17,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:23:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:17,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:23:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:17,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:23:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:17,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:23:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:17,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:23:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:17,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:23:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:17,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:23:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:17,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:23:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:17,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:23:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:23:17,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:17,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964436816] [2024-11-08 12:23:17,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964436816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:17,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:17,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 12:23:17,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085392420] [2024-11-08 12:23:17,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:17,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:23:17,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:17,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:23:17,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:23:17,089 INFO L87 Difference]: Start difference. First operand 511 states and 738 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:17,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:17,528 INFO L93 Difference]: Finished difference Result 980 states and 1418 transitions. [2024-11-08 12:23:17,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:23:17,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-08 12:23:17,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:17,532 INFO L225 Difference]: With dead ends: 980 [2024-11-08 12:23:17,532 INFO L226 Difference]: Without dead ends: 647 [2024-11-08 12:23:17,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 12:23:17,534 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 80 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:17,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 652 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 12:23:17,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-08 12:23:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 506. [2024-11-08 12:23:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 473 states have (on average 1.4334038054968288) internal successors, (678), 474 states have internal predecessors, (678), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:23:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 734 transitions. [2024-11-08 12:23:17,585 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 734 transitions. Word has length 109 [2024-11-08 12:23:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:17,586 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 734 transitions. [2024-11-08 12:23:17,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 734 transitions. [2024-11-08 12:23:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 12:23:17,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:17,588 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:17,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 12:23:17,588 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:17,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:17,589 INFO L85 PathProgramCache]: Analyzing trace with hash -47017612, now seen corresponding path program 1 times [2024-11-08 12:23:17,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:17,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216255167] [2024-11-08 12:23:17,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:17,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:19,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:23:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:19,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:23:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:19,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:23:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:19,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:23:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:19,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:23:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:19,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:23:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:19,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:23:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:19,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:23:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:19,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:23:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:19,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:23:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:19,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:23:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:19,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:23:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:23:19,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:19,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216255167] [2024-11-08 12:23:19,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216255167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:19,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:19,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 12:23:19,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252457534] [2024-11-08 12:23:19,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:19,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 12:23:19,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:19,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 12:23:19,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 12:23:19,759 INFO L87 Difference]: Start difference. First operand 506 states and 734 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 12:23:21,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:21,451 INFO L93 Difference]: Finished difference Result 895 states and 1303 transitions. [2024-11-08 12:23:21,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:23:21,453 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2024-11-08 12:23:21,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:21,456 INFO L225 Difference]: With dead ends: 895 [2024-11-08 12:23:21,456 INFO L226 Difference]: Without dead ends: 561 [2024-11-08 12:23:21,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-08 12:23:21,460 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 407 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:21,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 906 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 12:23:21,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-11-08 12:23:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 496. [2024-11-08 12:23:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 463 states have (on average 1.429805615550756) internal successors, (662), 464 states have internal predecessors, (662), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:23:21,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 718 transitions. [2024-11-08 12:23:21,522 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 718 transitions. Word has length 109 [2024-11-08 12:23:21,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:21,523 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 718 transitions. [2024-11-08 12:23:21,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 12:23:21,523 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 718 transitions. [2024-11-08 12:23:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 12:23:21,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:21,525 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:21,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 12:23:21,526 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:21,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:21,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1100362608, now seen corresponding path program 1 times [2024-11-08 12:23:21,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:21,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821604211] [2024-11-08 12:23:21,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:21,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:23,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 12:23:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:23,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 12:23:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:23,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 12:23:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:23,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 12:23:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:23,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 12:23:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:23,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 12:23:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:23,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 12:23:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:23,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 12:23:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:23,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 12:23:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:23,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 12:23:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:23,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 12:23:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:23,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 12:23:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:23:23,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:23:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821604211] [2024-11-08 12:23:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821604211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:23,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:23,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 12:23:23,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945142746] [2024-11-08 12:23:23,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:23,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 12:23:23,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:23:23,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 12:23:23,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-11-08 12:23:23,834 INFO L87 Difference]: Start difference. First operand 496 states and 718 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:26,274 INFO L93 Difference]: Finished difference Result 1028 states and 1487 transitions. [2024-11-08 12:23:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 12:23:26,275 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-08 12:23:26,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:26,279 INFO L225 Difference]: With dead ends: 1028 [2024-11-08 12:23:26,279 INFO L226 Difference]: Without dead ends: 704 [2024-11-08 12:23:26,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2024-11-08 12:23:26,281 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 214 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:26,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 2269 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 12:23:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-08 12:23:26,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 566. [2024-11-08 12:23:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 533 states have (on average 1.4333958724202627) internal successors, (764), 534 states have internal predecessors, (764), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:23:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 820 transitions. [2024-11-08 12:23:26,369 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 820 transitions. Word has length 110 [2024-11-08 12:23:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:26,370 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 820 transitions. [2024-11-08 12:23:26,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 820 transitions. [2024-11-08 12:23:26,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 12:23:26,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:26,372 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:26,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 12:23:26,374 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:26,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:26,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1569385383, now seen corresponding path program 1 times [2024-11-08 12:23:26,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:23:26,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514147619] [2024-11-08 12:23:26,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:26,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:23:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 12:23:26,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333639624] [2024-11-08 12:23:26,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:26,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:23:26,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:23:26,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:23:26,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 12:23:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:23:26,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:23:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:23:27,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:23:27,241 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:23:27,242 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 12:23:27,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 12:23:27,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:23:27,449 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:23:27,602 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 12:23:27,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 12:23:27 BoogieIcfgContainer [2024-11-08 12:23:27,606 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 12:23:27,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 12:23:27,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 12:23:27,607 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 12:23:27,607 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:22:51" (3/4) ... [2024-11-08 12:23:27,610 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 12:23:27,611 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 12:23:27,612 INFO L158 Benchmark]: Toolchain (without parser) took 38530.88ms. Allocated memory was 134.2MB in the beginning and 513.8MB in the end (delta: 379.6MB). Free memory was 75.5MB in the beginning and 372.0MB in the end (delta: -296.5MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. [2024-11-08 12:23:27,612 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 134.2MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:23:27,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.31ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 75.2MB in the beginning and 154.7MB in the end (delta: -79.5MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-08 12:23:27,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.09ms. Allocated memory is still 195.0MB. Free memory was 154.7MB in the beginning and 150.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 12:23:27,613 INFO L158 Benchmark]: Boogie Preprocessor took 130.57ms. Allocated memory is still 195.0MB. Free memory was 150.5MB in the beginning and 145.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 12:23:27,613 INFO L158 Benchmark]: RCFGBuilder took 1128.39ms. Allocated memory is still 195.0MB. Free memory was 145.5MB in the beginning and 105.8MB in the end (delta: 39.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-08 12:23:27,614 INFO L158 Benchmark]: TraceAbstraction took 36544.20ms. Allocated memory was 195.0MB in the beginning and 513.8MB in the end (delta: 318.8MB). Free memory was 105.0MB in the beginning and 372.0MB in the end (delta: -267.0MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2024-11-08 12:23:27,614 INFO L158 Benchmark]: Witness Printer took 4.99ms. Allocated memory is still 513.8MB. Free memory is still 372.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:23:27,616 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.24ms. Allocated memory is still 134.2MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 630.31ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 75.2MB in the beginning and 154.7MB in the end (delta: -79.5MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.09ms. Allocated memory is still 195.0MB. Free memory was 154.7MB in the beginning and 150.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.57ms. Allocated memory is still 195.0MB. Free memory was 150.5MB in the beginning and 145.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1128.39ms. Allocated memory is still 195.0MB. Free memory was 145.5MB in the beginning and 105.8MB in the end (delta: 39.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 36544.20ms. Allocated memory was 195.0MB in the beginning and 513.8MB in the end (delta: 318.8MB). Free memory was 105.0MB in the beginning and 372.0MB in the end (delta: -267.0MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. * Witness Printer took 4.99ms. Allocated memory is still 513.8MB. Free memory is still 372.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L26-L28] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L29] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L30] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L31] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[2]); [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L32-L34] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L35] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0][0]); [L36] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1][0]); [L37] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer = &(unsigned_short_int_Array_0[0][1]); [L38] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer = &(unsigned_short_int_Array_0[1][1]); [L39] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer = &(unsigned_short_int_Array_0[0][2]); [L40] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer = &(unsigned_short_int_Array_0[1][2]); [L41] unsigned short int last_1_unsigned_short_int_Array_0_0__0_ = 8; [L42] unsigned short int last_1_unsigned_short_int_Array_0_1__2_ = 10; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=0, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L94] EXPR unsigned_short_int_Array_0[0][0] [L94] last_1_unsigned_short_int_Array_0_0__0_ = unsigned_short_int_Array_0[0][0] [L95] EXPR unsigned_short_int_Array_0[1][2] [L95] last_1_unsigned_short_int_Array_0_1__2_ = unsigned_short_int_Array_0[1][2] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L73] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L74] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L74] CALL assume_abort_if_not(BOOL_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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L74] RET assume_abort_if_not(BOOL_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L75] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L75] 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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L75] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L76] float_Array_0[0] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= -922337.2036854765600e+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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= -922337.2036854765600e+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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L77] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L78] float_Array_0[1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L79] EXPR float_Array_0[1] [L79] EXPR float_Array_0[1] >= -922337.2036854765600e+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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L79] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L80] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L81] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L81] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L81] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L82] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L82] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L82] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L83] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L84] EXPR unsigned_short_int_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L85] EXPR unsigned_short_int_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L86] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L87] EXPR unsigned_short_int_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L87] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L87] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L88] EXPR unsigned_short_int_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L88] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L88] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L89] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L90] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L91] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L106] RET updateVariables() [L107] CALL step() [L46] COND TRUE last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L47] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L47] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L47] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) [L47] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L47] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L47] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) = (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))) [L49] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L49] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L49] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L49] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L49] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L49] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L49] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) [L60] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L60] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) [L62] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L62] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L62] COND FALSE !((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) [L69] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L69] (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR (last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1 [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L98] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer) [L98] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))))) [L98] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L98] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L98] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) [L98] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L98] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) [L98] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L98] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L98] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L98-L99] return (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((unsigned short int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) > (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer))))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))) : (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) > ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))))))))) : 1) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) == (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) <= (((((0) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (0) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer))))) << (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer)) == ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)) * (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 2))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer)))))) && (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) != (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) <= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) ; [L108] RET, EXPR property() [L108] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={6:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={6:6}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer={6:8}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer={6:4}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer={6:10}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.3s, OverallIterations: 19, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2913 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2911 mSDsluCounter, 12194 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9435 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5809 IncrementalHoareTripleChecker+Invalid, 6007 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 2759 mSDtfsCounter, 5809 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 721 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=566occurred in iteration=18, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 1153 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 2230 NumberOfCodeBlocks, 2230 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1885 ConstructedInterpolants, 0 QuantifiedInterpolants, 11442 SizeOfPredicates, 3 NumberOfNonLiveVariables, 400 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 4752/4752 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-08 12:23:27,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX --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 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 12:23:30,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:23:30,593 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 12:23:30,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:23:30,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:23:30,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:23:30,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:23:30,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:23:30,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:23:30,660 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:23:30,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:23:30,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:23:30,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:23:30,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:23:30,664 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:23:30,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:23:30,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:23:30,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:23:30,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:23:30,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:23:30,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:23:30,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:23:30,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:23:30,669 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 12:23:30,669 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 12:23:30,670 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:23:30,670 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 12:23:30,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:23:30,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:23:30,671 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:23:30,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:23:30,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:23:30,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:23:30,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:23:30,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:23:30,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:23:30,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:23:30,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:23:30,676 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 12:23:30,676 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 12:23:30,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:23:30,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:23:30,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:23:30,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:23:30,679 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX 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 -> 710898c12be450ceaf3ec059dd22affd0a643f08a3f9849d9320be04e811c088 [2024-11-08 12:23:31,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:23:31,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:23:31,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:23:31,209 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:23:31,210 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:23:31,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i Unable to find full path for "g++" [2024-11-08 12:23:33,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:23:34,126 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:23:34,127 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i [2024-11-08 12:23:34,141 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/data/5146a798c/ed0b55b65ea441da98da7fa6f498de26/FLAG288012f15 [2024-11-08 12:23:34,463 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/data/5146a798c/ed0b55b65ea441da98da7fa6f498de26 [2024-11-08 12:23:34,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:23:34,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:23:34,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:23:34,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:23:34,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:23:34,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:23:34" (1/1) ... [2024-11-08 12:23:34,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2706719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:34, skipping insertion in model container [2024-11-08 12:23:34,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:23:34" (1/1) ... [2024-11-08 12:23:34,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:23:34,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i[916,929] [2024-11-08 12:23:34,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:23:34,987 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:23:35,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-2.i[916,929] [2024-11-08 12:23:35,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:23:35,106 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:23:35,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:35 WrapperNode [2024-11-08 12:23:35,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:23:35,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:23:35,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:23:35,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:23:35,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:35" (1/1) ... [2024-11-08 12:23:35,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:35" (1/1) ... [2024-11-08 12:23:35,220 INFO L138 Inliner]: procedures = 33, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 509 [2024-11-08 12:23:35,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:23:35,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:23:35,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:23:35,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:23:35,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:35" (1/1) ... [2024-11-08 12:23:35,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:35" (1/1) ... [2024-11-08 12:23:35,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:35" (1/1) ... [2024-11-08 12:23:35,319 INFO L175 MemorySlicer]: Split 131 memory accesses to 4 slices as follows [2, 8, 31, 90]. 69 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 6]. The 15 writes are split as follows [0, 1, 5, 9]. [2024-11-08 12:23:35,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:35" (1/1) ... [2024-11-08 12:23:35,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:35" (1/1) ... [2024-11-08 12:23:35,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:35" (1/1) ... [2024-11-08 12:23:35,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:35" (1/1) ... [2024-11-08 12:23:35,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:35" (1/1) ... [2024-11-08 12:23:35,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:35" (1/1) ... [2024-11-08 12:23:35,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:23:35,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:23:35,406 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:23:35,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:23:35,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:35" (1/1) ... [2024-11-08 12:23:35,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:23:35,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:23:35,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 12:23:35,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 12:23:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:23:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 12:23:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 12:23:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 12:23:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 12:23:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-08 12:23:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-08 12:23:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-08 12:23:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-08 12:23:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 12:23:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 12:23:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 12:23:35,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 12:23:35,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 12:23:35,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 12:23:35,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-08 12:23:35,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-08 12:23:35,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 12:23:35,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 12:23:35,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-08 12:23:35,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-08 12:23:35,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 12:23:35,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 12:23:35,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-08 12:23:35,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-08 12:23:35,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-08 12:23:35,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-08 12:23:35,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-08 12:23:35,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-08 12:23:35,524 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 12:23:35,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 12:23:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:23:35,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:23:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 12:23:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 12:23:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 12:23:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 12:23:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 12:23:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 12:23:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-08 12:23:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-08 12:23:35,733 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:23:35,735 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:23:36,766 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-08 12:23:36,766 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:23:36,786 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:23:36,788 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 12:23:36,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:23:36 BoogieIcfgContainer [2024-11-08 12:23:36,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:23:36,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:23:36,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:23:36,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:23:36,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:23:34" (1/3) ... [2024-11-08 12:23:36,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c55823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:23:36, skipping insertion in model container [2024-11-08 12:23:36,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:23:35" (2/3) ... [2024-11-08 12:23:36,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c55823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:23:36, skipping insertion in model container [2024-11-08 12:23:36,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:23:36" (3/3) ... [2024-11-08 12:23:36,804 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-2.i [2024-11-08 12:23:36,827 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:23:36,827 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:23:36,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:23:36,949 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;@2cc3a0b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:23:36,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:23:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 12:23:36,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 12:23:36,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:36,977 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:36,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:36,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:36,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1606850698, now seen corresponding path program 1 times [2024-11-08 12:23:37,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:23:37,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834212280] [2024-11-08 12:23:37,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:37,008 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-08 12:23:37,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 12:23:37,011 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:37,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:37,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 12:23:37,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:23:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-08 12:23:37,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:23:37,596 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:23:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834212280] [2024-11-08 12:23:37,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834212280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:37,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:37,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:23:37,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520724526] [2024-11-08 12:23:37,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:37,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:23:37,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:23:37,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:23:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:23:37,666 INFO L87 Difference]: Start difference. First operand has 100 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 12:23:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:37,705 INFO L93 Difference]: Finished difference Result 193 states and 302 transitions. [2024-11-08 12:23:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:23:37,708 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-08 12:23:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:37,717 INFO L225 Difference]: With dead ends: 193 [2024-11-08 12:23:37,718 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 12:23:37,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:23:37,727 INFO L432 NwaCegarLoop]: 141 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, 141 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-08 12:23:37,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 12:23:37,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-08 12:23:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 12:23:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2024-11-08 12:23:37,794 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 100 [2024-11-08 12:23:37,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:37,795 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2024-11-08 12:23:37,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 12:23:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2024-11-08 12:23:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 12:23:37,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:37,802 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:37,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:38,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:38,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:38,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:38,005 INFO L85 PathProgramCache]: Analyzing trace with hash 620069982, now seen corresponding path program 1 times [2024-11-08 12:23:38,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:23:38,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179797886] [2024-11-08 12:23:38,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:38,007 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-08 12:23:38,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 12:23:38,010 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:38,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:38,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 12:23:38,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:23:38,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:23:38,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 37 treesize of output 17 [2024-11-08 12:23:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:23:39,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:23:39,530 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:23:39,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179797886] [2024-11-08 12:23:39,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179797886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:39,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:39,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:39,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877722756] [2024-11-08 12:23:39,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:39,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:23:39,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:23:39,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:23:39,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:23:39,535 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:40,113 INFO L93 Difference]: Finished difference Result 283 states and 418 transitions. [2024-11-08 12:23:40,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:23:40,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-11-08 12:23:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:40,118 INFO L225 Difference]: With dead ends: 283 [2024-11-08 12:23:40,119 INFO L226 Difference]: Without dead ends: 190 [2024-11-08 12:23:40,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:23:40,121 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 128 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:40,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 348 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 12:23:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-08 12:23:40,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 158. [2024-11-08 12:23:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 131 states have (on average 1.4045801526717556) internal successors, (184), 131 states have internal predecessors, (184), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 12:23:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 232 transitions. [2024-11-08 12:23:40,159 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 232 transitions. Word has length 100 [2024-11-08 12:23:40,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:40,161 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 232 transitions. [2024-11-08 12:23:40,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:40,161 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 232 transitions. [2024-11-08 12:23:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 12:23:40,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:40,165 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:40,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 12:23:40,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:40,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:40,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1463158389, now seen corresponding path program 1 times [2024-11-08 12:23:40,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:23:40,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707943172] [2024-11-08 12:23:40,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:40,373 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-08 12:23:40,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 12:23:40,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:40,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:40,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 12:23:40,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:23:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:23:40,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:23:40,810 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:23:40,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707943172] [2024-11-08 12:23:40,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707943172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:40,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:40,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:23:40,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798682586] [2024-11-08 12:23:40,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:40,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:23:40,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:23:40,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:23:40,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:23:40,815 INFO L87 Difference]: Start difference. First operand 158 states and 232 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:40,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:40,856 INFO L93 Difference]: Finished difference Result 260 states and 384 transitions. [2024-11-08 12:23:40,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:23:40,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-08 12:23:40,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:40,860 INFO L225 Difference]: With dead ends: 260 [2024-11-08 12:23:40,863 INFO L226 Difference]: Without dead ends: 160 [2024-11-08 12:23:40,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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-08 12:23:40,866 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 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-08 12:23:40,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:23:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-08 12:23:40,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-08 12:23:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 133 states have (on average 1.3984962406015038) internal successors, (186), 133 states have internal predecessors, (186), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 12:23:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 234 transitions. [2024-11-08 12:23:40,919 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 234 transitions. Word has length 106 [2024-11-08 12:23:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:40,920 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 234 transitions. [2024-11-08 12:23:40,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 234 transitions. [2024-11-08 12:23:40,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 12:23:40,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:40,927 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:40,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:41,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:41,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:41,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:41,128 INFO L85 PathProgramCache]: Analyzing trace with hash -125189513, now seen corresponding path program 1 times [2024-11-08 12:23:41,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:23:41,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321341435] [2024-11-08 12:23:41,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:41,130 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-08 12:23:41,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 12:23:41,134 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:41,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:41,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 12:23:41,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:23:41,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:23:41,628 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 32 treesize of output 28 [2024-11-08 12:23:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:23:41,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:23:41,725 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:23:41,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321341435] [2024-11-08 12:23:41,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321341435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:23:41,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:23:41,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:23:41,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554742998] [2024-11-08 12:23:41,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:23:41,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:23:41,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:23:41,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:23:41,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:23:41,731 INFO L87 Difference]: Start difference. First operand 160 states and 234 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:23:42,408 INFO L93 Difference]: Finished difference Result 313 states and 456 transitions. [2024-11-08 12:23:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:23:42,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-08 12:23:42,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:23:42,412 INFO L225 Difference]: With dead ends: 313 [2024-11-08 12:23:42,412 INFO L226 Difference]: Without dead ends: 219 [2024-11-08 12:23:42,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:23:42,414 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 78 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 12:23:42,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 509 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 12:23:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-08 12:23:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2024-11-08 12:23:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 184 states have (on average 1.4021739130434783) internal successors, (258), 185 states have internal predecessors, (258), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:23:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 314 transitions. [2024-11-08 12:23:42,443 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 314 transitions. Word has length 106 [2024-11-08 12:23:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:23:42,444 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 314 transitions. [2024-11-08 12:23:42,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:23:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 314 transitions. [2024-11-08 12:23:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 12:23:42,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:23:42,447 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:23:42,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 12:23:42,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:42,648 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:23:42,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:23:42,649 INFO L85 PathProgramCache]: Analyzing trace with hash 575875065, now seen corresponding path program 1 times [2024-11-08 12:23:42,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:23:42,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411200596] [2024-11-08 12:23:42,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:42,651 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-08 12:23:42,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 12:23:42,655 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:42,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:23:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:43,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 12:23:43,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:23:46,972 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-08 12:23:47,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-08 12:23:48,056 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2024-11-08 12:23:48,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 47 [2024-11-08 12:23:48,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:23:48,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 27 [2024-11-08 12:23:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-08 12:23:48,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:23:57,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:23:57,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411200596] [2024-11-08 12:23:57,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411200596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:23:57,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677301915] [2024-11-08 12:23:57,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:23:57,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:23:57,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:23:57,456 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:23:57,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 12:23:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:23:57,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 12:23:57,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:24:01,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-08 12:24:02,435 INFO L349 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2024-11-08 12:24:02,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 46 [2024-11-08 12:24:03,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:24:03,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 22 [2024-11-08 12:24:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-08 12:24:03,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:24:13,288 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-08 12:24:13,288 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 1326 treesize of output 1077 [2024-11-08 12:24:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:24:19,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677301915] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 12:24:19,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:24:19,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10, 11] total 25 [2024-11-08 12:24:19,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031752029] [2024-11-08 12:24:19,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:24:19,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 12:24:19,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:24:19,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 12:24:19,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=647, Unknown=3, NotChecked=0, Total=756 [2024-11-08 12:24:19,589 INFO L87 Difference]: Start difference. First operand 216 states and 314 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:24:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:24:26,839 INFO L93 Difference]: Finished difference Result 519 states and 756 transitions. [2024-11-08 12:24:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:24:26,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-08 12:24:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:24:26,846 INFO L225 Difference]: With dead ends: 519 [2024-11-08 12:24:26,846 INFO L226 Difference]: Without dead ends: 371 [2024-11-08 12:24:26,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=173, Invalid=1084, Unknown=3, NotChecked=0, Total=1260 [2024-11-08 12:24:26,849 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 361 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-08 12:24:26,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 783 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-08 12:24:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-08 12:24:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 262. [2024-11-08 12:24:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 230 states have (on average 1.4173913043478261) internal successors, (326), 231 states have internal predecessors, (326), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:24:26,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 382 transitions. [2024-11-08 12:24:26,908 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 382 transitions. Word has length 106 [2024-11-08 12:24:26,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:24:26,909 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 382 transitions. [2024-11-08 12:24:26,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:24:26,909 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 382 transitions. [2024-11-08 12:24:26,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 12:24:26,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:24:26,912 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:24:26,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 12:24:27,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 12:24:27,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:24:27,315 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:24:27,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:24:27,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1872734837, now seen corresponding path program 1 times [2024-11-08 12:24:27,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:24:27,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423383884] [2024-11-08 12:24:27,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:24:27,317 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-08 12:24:27,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 12:24:27,320 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:24:27,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:24:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:27,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 12:24:27,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:24:30,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 12:24:32,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 12:24:33,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 12:24:34,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 12:24:35,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2024-11-08 12:24:36,072 INFO L349 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2024-11-08 12:24:36,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 54 [2024-11-08 12:24:36,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:24:36,581 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 51 treesize of output 27 [2024-11-08 12:24:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-08 12:24:36,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:25:13,133 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:25:13,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423383884] [2024-11-08 12:25:13,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423383884] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:25:13,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161021008] [2024-11-08 12:25:13,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:25:13,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:25:13,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:25:13,136 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:25:13,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 12:25:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:25:13,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 12:25:13,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:25:28,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2024-11-08 12:25:29,470 INFO L349 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2024-11-08 12:25:29,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58 [2024-11-08 12:25:29,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:25:29,929 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 51 treesize of output 27 [2024-11-08 12:25:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:25:30,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:25:30,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161021008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:25:30,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 12:25:30,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2024-11-08 12:25:30,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14919106] [2024-11-08 12:25:30,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:25:30,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 12:25:30,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:25:30,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 12:25:30,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=443, Unknown=10, NotChecked=0, Total=552 [2024-11-08 12:25:30,050 INFO L87 Difference]: Start difference. First operand 262 states and 382 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:25:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:25:36,071 INFO L93 Difference]: Finished difference Result 541 states and 788 transitions. [2024-11-08 12:25:36,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:25:36,073 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-08 12:25:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:25:36,076 INFO L225 Difference]: With dead ends: 541 [2024-11-08 12:25:36,076 INFO L226 Difference]: Without dead ends: 366 [2024-11-08 12:25:36,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 217 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 47.3s TimeCoverageRelationStatistics Valid=158, Invalid=588, Unknown=10, NotChecked=0, Total=756 [2024-11-08 12:25:36,078 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 355 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:25:36,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 705 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-08 12:25:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-08 12:25:36,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 309. [2024-11-08 12:25:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 276 states have (on average 1.431159420289855) internal successors, (395), 277 states have internal predecessors, (395), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:25:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 451 transitions. [2024-11-08 12:25:36,128 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 451 transitions. Word has length 108 [2024-11-08 12:25:36,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:25:36,129 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 451 transitions. [2024-11-08 12:25:36,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:25:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 451 transitions. [2024-11-08 12:25:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 12:25:36,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:25:36,132 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:25:36,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 12:25:36,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:25:36,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:25:36,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:25:36,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:25:36,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1428032493, now seen corresponding path program 1 times [2024-11-08 12:25:36,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:25:36,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393350552] [2024-11-08 12:25:36,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:25:36,536 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-08 12:25:36,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 12:25:36,537 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:25:36,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:25:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:25:36,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 12:25:36,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:25:37,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:25:37,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 62 [2024-11-08 12:25:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:25:37,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:25:37,425 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:25:37,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393350552] [2024-11-08 12:25:37,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393350552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:25:37,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:25:37,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:25:37,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941142519] [2024-11-08 12:25:37,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:25:37,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:25:37,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:25:37,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:25:37,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:25:37,427 INFO L87 Difference]: Start difference. First operand 309 states and 451 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:25:40,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 12:25:43,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 12:25:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:25:44,120 INFO L93 Difference]: Finished difference Result 533 states and 781 transitions. [2024-11-08 12:25:44,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:25:44,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-08 12:25:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:25:44,124 INFO L225 Difference]: With dead ends: 533 [2024-11-08 12:25:44,124 INFO L226 Difference]: Without dead ends: 315 [2024-11-08 12:25:44,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:25:44,126 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 4 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-08 12:25:44,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 453 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-08 12:25:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-08 12:25:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2024-11-08 12:25:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 278 states have (on average 1.4280575539568345) internal successors, (397), 279 states have internal predecessors, (397), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 12:25:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 453 transitions. [2024-11-08 12:25:44,172 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 453 transitions. Word has length 108 [2024-11-08 12:25:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:25:44,172 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 453 transitions. [2024-11-08 12:25:44,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:25:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 453 transitions. [2024-11-08 12:25:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 12:25:44,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:25:44,175 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:25:44,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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)] Forceful destruction successful, exit code 0 [2024-11-08 12:25:44,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:25:44,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:25:44,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:25:44,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1005330667, now seen corresponding path program 1 times [2024-11-08 12:25:44,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:25:44,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140740707] [2024-11-08 12:25:44,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:25:44,383 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-08 12:25:44,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 12:25:44,386 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:25:44,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:25:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:25:44,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 12:25:44,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:25:49,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 12:25:50,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 12:25:51,873 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-08 12:25:53,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-08 12:25:56,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2024-11-08 12:25:57,075 INFO L349 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2024-11-08 12:25:57,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 66 [2024-11-08 12:25:57,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:25:57,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 32 [2024-11-08 12:25:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 64 proven. 80 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 12:25:58,047 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:26:04,277 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:26:04,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140740707] [2024-11-08 12:26:04,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140740707] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:26:04,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041301789] [2024-11-08 12:26:04,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:26:04,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:26:04,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:26:04,279 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:26:04,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 12:26:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:26:04,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 12:26:04,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:26:13,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-08 12:26:13,931 INFO L349 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2024-11-08 12:26:13,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 61 [2024-11-08 12:26:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-08 12:26:15,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:27:54,086 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-08 12:27:54,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3563 treesize of output 2865 [2024-11-08 12:28:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:28:24,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041301789] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 12:28:24,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:28:24,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11, 13] total 37 [2024-11-08 12:28:24,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107564649] [2024-11-08 12:28:24,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:28:24,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 12:28:24,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:28:24,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 12:28:24,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1717, Unknown=13, NotChecked=0, Total=1980 [2024-11-08 12:28:24,654 INFO L87 Difference]: Start difference. First operand 311 states and 453 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:28:33,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:28:36,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:29:40,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:29:42,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:29:47,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:29:51,085 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (= c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base)) (.cse17 (= c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset)) (.cse3 (= c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer~0.base c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base)) (.cse16 (= c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer~0.offset c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))) (let ((.cse7 (select |c_#memory_int#3| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer~0.base)) (.cse11 (not .cse16)) (.cse12 (not .cse3)) (.cse13 (and .cse18 .cse17)) (.cse0 (not .cse18)) (.cse1 (not .cse17)) (.cse2 (= c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer~0.base c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer~0.base))) (and (or .cse0 .cse1 .cse2 .cse3) (forall ((~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base (_ BitVec 32)) (~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.offset (_ BitVec 32))) (let ((.cse5 (let ((.cse6 (store |c_#memory_int#3| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer~0.base (store .cse7 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) |c_ULTIMATE.start_step_#t~ite20#1|)))))) (store .cse6 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base (store (select .cse6 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse6 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base) ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.offset)))))))) (let ((.cse4 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer~0.offset))))) (or (not (bvsgt .cse4 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))))) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse5 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) .cse4))))))) (forall ((~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base (_ BitVec 32)) (~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.offset (_ BitVec 32))) (let ((.cse9 (let ((.cse10 (store |c_#memory_int#3| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer~0.base (store .cse7 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (select (select |c_#memory_int#3| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))))))))) (store .cse10 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base (store (select .cse10 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse10 ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base) ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.offset)))))))) (let ((.cse8 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse9 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer~0.offset))))) (or (not (bvsgt .cse8 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse9 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))))) (= ((_ zero_extend 16) ((_ extract 15 0) .cse8)) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse9 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer~0.offset)))))))) (or .cse11 .cse12 .cse13 (= c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer~0.base c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base)) (forall ((~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base (_ BitVec 32)) (~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.offset (_ BitVec 32))) (let ((.cse15 (store |c_#memory_int#3| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base (store (select |c_#memory_int#3| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int#3| ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.base) ~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var3_Pointer~0.offset))))))) (let ((.cse14 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse15 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer~0.offset))))) (or (= ((_ zero_extend 16) ((_ extract 15 0) .cse14)) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse15 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer~0.offset)))) (not (bvsgt .cse14 ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse15 c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.offset))))))))) (or .cse0 .cse1 (and .cse16 .cse3) (= c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var4_Pointer~0.offset c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer~0.offset)) (or (and (or .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse16)) (= c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var5_Pointer~0.offset c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer~0.offset))))) is different from false [2024-11-08 12:29:58,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:30:02,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:30:09,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:30:16,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:30:18,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:30:22,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:30:35,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:30:35,635 INFO L93 Difference]: Finished difference Result 880 states and 1284 transitions. [2024-11-08 12:30:35,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 12:30:35,636 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-08 12:30:35,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:30:35,641 INFO L225 Difference]: With dead ends: 880 [2024-11-08 12:30:35,641 INFO L226 Difference]: Without dead ends: 681 [2024-11-08 12:30:35,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 184.9s TimeCoverageRelationStatistics Valid=348, Invalid=2717, Unknown=19, NotChecked=108, Total=3192 [2024-11-08 12:30:35,645 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 217 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 8 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 58.9s IncrementalHoareTripleChecker+Time [2024-11-08 12:30:35,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1717 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1250 Invalid, 7 Unknown, 13 Unchecked, 58.9s Time] [2024-11-08 12:30:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-08 12:30:35,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 556. [2024-11-08 12:30:35,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 505 states have (on average 1.4435643564356435) internal successors, (729), 507 states have internal predecessors, (729), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 12:30:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 817 transitions. [2024-11-08 12:30:35,736 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 817 transitions. Word has length 108 [2024-11-08 12:30:35,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:30:35,737 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 817 transitions. [2024-11-08 12:30:35,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:30:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 817 transitions. [2024-11-08 12:30:35,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 12:30:35,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:30:35,739 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:30:35,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:30:35,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-08 12:30:36,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:30:36,140 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:30:36,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:30:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash -616794125, now seen corresponding path program 1 times [2024-11-08 12:30:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:30:36,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179886550] [2024-11-08 12:30:36,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:30:36,147 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-08 12:30:36,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 12:30:36,148 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:30:36,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:30:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:30:36,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 12:30:36,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:30:44,229 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-08 12:30:48,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-08 12:30:52,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-08 12:30:59,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 54 [2024-11-08 12:31:00,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2024-11-08 12:31:01,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:31:01,243 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 84 treesize of output 52 [2024-11-08 12:31:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 86 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-08 12:31:01,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:31:11,010 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:31:11,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179886550] [2024-11-08 12:31:11,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179886550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:31:11,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723469100] [2024-11-08 12:31:11,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:31:11,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:31:11,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:31:11,014 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:31:11,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 12:31:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:31:11,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 12:31:11,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:31:18,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 12:31:23,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 12:31:27,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2024-11-08 12:31:32,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2024-11-08 12:31:33,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2024-11-08 12:31:34,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:31:34,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 84 treesize of output 44 [2024-11-08 12:31:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 83 proven. 86 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-08 12:31:34,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:31:36,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723469100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:31:36,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:31:36,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2024-11-08 12:31:36,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685283956] [2024-11-08 12:31:36,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:31:36,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 12:31:36,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:31:36,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 12:31:36,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1565, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 12:31:36,697 INFO L87 Difference]: Start difference. First operand 556 states and 817 transitions. Second operand has 34 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 30 states have internal predecessors, (95), 10 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-08 12:32:11,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 12:32:54,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 12:33:02,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 12:33:07,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 12:33:18,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 12:33:32,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 12:33:39,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 12:33:47,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 12:33:49,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 12:33:59,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 12:34:06,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:34:06,568 INFO L93 Difference]: Finished difference Result 1626 states and 2318 transitions. [2024-11-08 12:34:06,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-08 12:34:06,570 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 30 states have internal predecessors, (95), 10 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) Word has length 108 [2024-11-08 12:34:06,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:34:06,582 INFO L225 Difference]: With dead ends: 1626 [2024-11-08 12:34:06,585 INFO L226 Difference]: Without dead ends: 1207 [2024-11-08 12:34:06,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 65.8s TimeCoverageRelationStatistics Valid=1168, Invalid=4532, Unknown=0, NotChecked=0, Total=5700 [2024-11-08 12:34:06,589 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1927 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 400 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 106.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1929 SdHoareTripleChecker+Valid, 2514 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 108.5s IncrementalHoareTripleChecker+Time [2024-11-08 12:34:06,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1929 Valid, 2514 Invalid, 2717 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [400 Valid, 2315 Invalid, 2 Unknown, 0 Unchecked, 108.5s Time] [2024-11-08 12:34:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2024-11-08 12:34:06,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 863. [2024-11-08 12:34:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 772 states have (on average 1.4132124352331605) internal successors, (1091), 778 states have internal predecessors, (1091), 68 states have call successors, (68), 22 states have call predecessors, (68), 22 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 12:34:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1227 transitions. [2024-11-08 12:34:06,841 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1227 transitions. Word has length 108 [2024-11-08 12:34:06,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:34:06,842 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1227 transitions. [2024-11-08 12:34:06,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 30 states have internal predecessors, (95), 10 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-08 12:34:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1227 transitions. [2024-11-08 12:34:06,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 12:34:06,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:34:06,845 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:34:06,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:34:07,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-08 12:34:07,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:34:07,250 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:34:07,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:34:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash -201381313, now seen corresponding path program 1 times [2024-11-08 12:34:07,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:34:07,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126019122] [2024-11-08 12:34:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:34:07,251 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-08 12:34:07,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 12:34:07,252 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:34:07,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:34:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:34:07,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 12:34:07,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:34:14,777 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-08 12:34:17,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-08 12:34:22,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-08 12:34:25,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2024-11-08 12:34:26,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2024-11-08 12:34:29,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:34:29,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 55 [2024-11-08 12:34:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 83 proven. 86 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-08 12:34:29,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:34:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:34:31,499 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:34:31,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126019122] [2024-11-08 12:34:31,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126019122] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 12:34:31,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 12:34:31,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 24 [2024-11-08 12:34:31,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678764756] [2024-11-08 12:34:31,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:34:31,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 12:34:31,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:34:31,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 12:34:31,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2024-11-08 12:34:31,502 INFO L87 Difference]: Start difference. First operand 863 states and 1227 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:34:34,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:34:34,266 INFO L93 Difference]: Finished difference Result 2156 states and 3080 transitions. [2024-11-08 12:34:34,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:34:34,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-08 12:34:34,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:34:34,277 INFO L225 Difference]: With dead ends: 2156 [2024-11-08 12:34:34,277 INFO L226 Difference]: Without dead ends: 1446 [2024-11-08 12:34:34,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2024-11-08 12:34:34,280 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 189 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:34:34,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 752 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 12:34:34,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2024-11-08 12:34:34,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1154. [2024-11-08 12:34:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1053 states have (on average 1.4150047483380817) internal successors, (1490), 1061 states have internal predecessors, (1490), 76 states have call successors, (76), 24 states have call predecessors, (76), 24 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-08 12:34:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1642 transitions. [2024-11-08 12:34:34,549 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1642 transitions. Word has length 109 [2024-11-08 12:34:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:34:34,550 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1642 transitions. [2024-11-08 12:34:34,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:34:34,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1642 transitions. [2024-11-08 12:34:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 12:34:34,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:34:34,553 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:34:34,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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)] Ended with exit code 0 [2024-11-08 12:34:34,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:34:34,754 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:34:34,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:34:34,755 INFO L85 PathProgramCache]: Analyzing trace with hash 348532538, now seen corresponding path program 1 times [2024-11-08 12:34:34,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:34:34,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506043334] [2024-11-08 12:34:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:34:34,756 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-08 12:34:34,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 12:34:34,757 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:34:34,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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 (16)] Waiting until timeout for monitored process [2024-11-08 12:34:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:34:35,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 12:34:35,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:34:35,939 INFO L349 Elim1Store]: treesize reduction 6, result has 83.8 percent of original size [2024-11-08 12:34:35,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 74 [2024-11-08 12:34:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:34:36,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:34:36,236 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:34:36,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506043334] [2024-11-08 12:34:36,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506043334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:34:36,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:34:36,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 12:34:36,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462151787] [2024-11-08 12:34:36,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:34:36,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 12:34:36,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:34:36,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 12:34:36,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 12:34:36,238 INFO L87 Difference]: Start difference. First operand 1154 states and 1642 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:34:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:34:39,323 INFO L93 Difference]: Finished difference Result 2833 states and 4061 transitions. [2024-11-08 12:34:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 12:34:39,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-08 12:34:39,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:34:39,337 INFO L225 Difference]: With dead ends: 2833 [2024-11-08 12:34:39,338 INFO L226 Difference]: Without dead ends: 1864 [2024-11-08 12:34:39,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 12:34:39,341 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 82 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 12:34:39,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 649 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 12:34:39,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2024-11-08 12:34:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1274. [2024-11-08 12:34:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1173 states have (on average 1.4254049445865302) internal successors, (1672), 1181 states have internal predecessors, (1672), 76 states have call successors, (76), 24 states have call predecessors, (76), 24 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-08 12:34:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1824 transitions. [2024-11-08 12:34:39,540 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1824 transitions. Word has length 109 [2024-11-08 12:34:39,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:34:39,541 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1824 transitions. [2024-11-08 12:34:39,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 12:34:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1824 transitions. [2024-11-08 12:34:39,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 12:34:39,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:34:39,544 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:34:39,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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 (16)] Ended with exit code 0 [2024-11-08 12:34:39,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:34:39,745 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:34:39,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:34:39,745 INFO L85 PathProgramCache]: Analyzing trace with hash -352532040, now seen corresponding path program 1 times [2024-11-08 12:34:39,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:34:39,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891592256] [2024-11-08 12:34:39,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:34:39,746 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-08 12:34:39,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 12:34:39,749 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:34:39,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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 (17)] Waiting until timeout for monitored process [2024-11-08 12:34:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:34:40,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 12:34:40,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:34:47,126 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-08 12:34:49,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-08 12:34:53,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-08 12:34:56,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2024-11-08 12:34:56,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2024-11-08 12:34:57,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:34:57,383 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 56 treesize of output 28 [2024-11-08 12:34:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 83 proven. 86 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-08 12:34:57,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:35:02,814 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:35:02,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891592256] [2024-11-08 12:35:02,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891592256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:35:02,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613277368] [2024-11-08 12:35:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:35:02,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:35:02,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:35:02,818 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:35:02,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-08 12:35:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:35:03,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 12:35:03,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:35:09,698 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-08 12:35:14,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-08 12:35:19,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-08 12:35:23,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-08 12:35:24,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2024-11-08 12:35:24,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:35:24,972 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 52 treesize of output 28 [2024-11-08 12:35:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 86 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-08 12:35:25,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:35:25,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613277368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:35:25,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:35:25,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2024-11-08 12:35:25,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109256196] [2024-11-08 12:35:25,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:35:25,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-08 12:35:25,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:35:25,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-08 12:35:25,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=903, Unknown=1, NotChecked=0, Total=1056 [2024-11-08 12:35:25,633 INFO L87 Difference]: Start difference. First operand 1274 states and 1824 transitions. Second operand has 29 states, 25 states have (on average 3.84) internal successors, (96), 24 states have internal predecessors, (96), 10 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-08 12:35:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:35:45,880 INFO L93 Difference]: Finished difference Result 2928 states and 4158 transitions. [2024-11-08 12:35:45,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 12:35:45,881 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 3.84) internal successors, (96), 24 states have internal predecessors, (96), 10 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) Word has length 109 [2024-11-08 12:35:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:35:45,897 INFO L225 Difference]: With dead ends: 2928 [2024-11-08 12:35:45,898 INFO L226 Difference]: Without dead ends: 1849 [2024-11-08 12:35:45,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=471, Invalid=1784, Unknown=1, NotChecked=0, Total=2256 [2024-11-08 12:35:45,902 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 1217 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:35:45,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 1026 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2024-11-08 12:35:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2024-11-08 12:35:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1223. [2024-11-08 12:35:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1122 states have (on average 1.4153297682709447) internal successors, (1588), 1130 states have internal predecessors, (1588), 76 states have call successors, (76), 24 states have call predecessors, (76), 24 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-08 12:35:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1740 transitions. [2024-11-08 12:35:46,257 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1740 transitions. Word has length 109 [2024-11-08 12:35:46,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:35:46,258 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1740 transitions. [2024-11-08 12:35:46,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 3.84) internal successors, (96), 24 states have internal predecessors, (96), 10 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-08 12:35:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1740 transitions. [2024-11-08 12:35:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 12:35:46,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:35:46,260 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:35:46,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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 (17)] Ended with exit code 0 [2024-11-08 12:35:46,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-08 12:35:46,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:35:46,662 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:35:46,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:35:46,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1542518127, now seen corresponding path program 1 times [2024-11-08 12:35:46,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:35:46,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732563009] [2024-11-08 12:35:46,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:35:46,664 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-08 12:35:46,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 12:35:46,665 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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-08 12:35:46,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/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 (19)] Waiting until timeout for monitored process [2024-11-08 12:35:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:35:47,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 12:35:47,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:35:51,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 12:35:52,907 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-08 12:35:55,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-08 12:35:56,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-08 12:35:59,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-08 12:36:00,411 INFO L349 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2024-11-08 12:36:00,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 53 [2024-11-08 12:36:01,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:36:01,447 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 50 treesize of output 26 [2024-11-08 12:36:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 96 proven. 80 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 12:36:02,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:36:17,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:36:17,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732563009] [2024-11-08 12:36:17,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732563009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:36:17,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999743180] [2024-11-08 12:36:17,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:36:17,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:36:17,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 12:36:17,649 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:36:17,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64ca7c9-1dbc-4dca-ac38-9d01cb0fdbfb/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-08 12:36:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:36:17,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 12:36:17,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:36:26,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-08 12:36:27,737 INFO L349 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2024-11-08 12:36:27,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 46 [2024-11-08 12:36:29,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:36:29,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 22 [2024-11-08 12:36:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-08 12:36:29,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:36:58,116 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-08 12:36:58,117 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 974 treesize of output 789 [2024-11-08 12:37:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 12:37:08,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999743180] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 12:37:08,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:37:08,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13, 13] total 31 [2024-11-08 12:37:08,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377050532] [2024-11-08 12:37:08,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:37:08,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 12:37:08,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:37:08,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 12:37:08,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1044, Unknown=7, NotChecked=0, Total=1190 [2024-11-08 12:37:08,278 INFO L87 Difference]: Start difference. First operand 1223 states and 1740 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)