./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1 --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 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 11:19:25,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 11:19:25,911 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 11:19:25,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 11:19:25,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 11:19:25,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 11:19:25,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 11:19:25,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 11:19:25,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 11:19:25,940 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 11:19:25,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 11:19:25,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 11:19:25,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 11:19:25,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 11:19:25,941 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 11:19:25,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 11:19:25,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 11:19:25,941 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 11:19:25,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 11:19:25,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 11:19:25,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 11:19:25,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 11:19:25,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 11:19:25,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 11:19:25,941 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 11:19:25,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 11:19:25,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 11:19:25,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 11:19:25,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 11:19:25,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:19:25,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:19:25,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:19:25,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:19:25,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 11:19:25,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:19:25,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:19:25,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:19:25,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:19:25,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 11:19:25,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 11:19:25,943 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 11:19:25,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 11:19:25,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 11:19:25,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 11:19:25,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 11:19:25,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 11:19:25,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 11:19:25,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 11:19:25,944 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1 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 -> 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c [2024-12-02 11:19:26,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 11:19:26,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 11:19:26,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 11:19:26,204 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 11:19:26,204 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 11:19:26,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2024-12-02 11:19:28,968 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/data/4a3a43aa3/29eb00a930bf4b5d987ee28b8ee5fe65/FLAG379b4e740 [2024-12-02 11:19:29,201 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 11:19:29,202 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2024-12-02 11:19:29,213 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/data/4a3a43aa3/29eb00a930bf4b5d987ee28b8ee5fe65/FLAG379b4e740 [2024-12-02 11:19:29,231 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/data/4a3a43aa3/29eb00a930bf4b5d987ee28b8ee5fe65 [2024-12-02 11:19:29,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 11:19:29,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 11:19:29,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 11:19:29,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 11:19:29,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 11:19:29,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:19:29" (1/1) ... [2024-12-02 11:19:29,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa2229e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29, skipping insertion in model container [2024-12-02 11:19:29,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:19:29" (1/1) ... [2024-12-02 11:19:29,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 11:19:29,413 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_c806768f-8687-4de8-b5fe-90e43da6e9dd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2024-12-02 11:19:29,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:19:29,498 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 11:19:29,510 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_c806768f-8687-4de8-b5fe-90e43da6e9dd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2024-12-02 11:19:29,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:19:29,568 INFO L204 MainTranslator]: Completed translation [2024-12-02 11:19:29,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29 WrapperNode [2024-12-02 11:19:29,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 11:19:29,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 11:19:29,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 11:19:29,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 11:19:29,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29" (1/1) ... [2024-12-02 11:19:29,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29" (1/1) ... [2024-12-02 11:19:29,622 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 588 [2024-12-02 11:19:29,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 11:19:29,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 11:19:29,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 11:19:29,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 11:19:29,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29" (1/1) ... [2024-12-02 11:19:29,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29" (1/1) ... [2024-12-02 11:19:29,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29" (1/1) ... [2024-12-02 11:19:29,660 INFO L175 MemorySlicer]: Split 147 memory accesses to 5 slices as follows [2, 41, 11, 16, 77]. 52 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 5, 2, 1, 6]. The 18 writes are split as follows [0, 8, 2, 1, 7]. [2024-12-02 11:19:29,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29" (1/1) ... [2024-12-02 11:19:29,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29" (1/1) ... [2024-12-02 11:19:29,678 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29" (1/1) ... [2024-12-02 11:19:29,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29" (1/1) ... [2024-12-02 11:19:29,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29" (1/1) ... [2024-12-02 11:19:29,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29" (1/1) ... [2024-12-02 11:19:29,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29" (1/1) ... [2024-12-02 11:19:29,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 11:19:29,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 11:19:29,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 11:19:29,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 11:19:29,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29" (1/1) ... [2024-12-02 11:19:29,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:19:29,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:19:29,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 11:19:29,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 11:19:29,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 11:19:29,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-12-02 11:19:29,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-12-02 11:19:29,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-12-02 11:19:29,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-12-02 11:19:29,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-12-02 11:19:29,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-02 11:19:29,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-02 11:19:29,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-12-02 11:19:29,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-12-02 11:19:29,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-12-02 11:19:29,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-12-02 11:19:29,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-12-02 11:19:29,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-12-02 11:19:29,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-12-02 11:19:29,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-12-02 11:19:29,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-02 11:19:29,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-02 11:19:29,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-12-02 11:19:29,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-12-02 11:19:29,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-12-02 11:19:29,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-12-02 11:19:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-12-02 11:19:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-12-02 11:19:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-12-02 11:19:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-12-02 11:19:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-02 11:19:29,762 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-02 11:19:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 11:19:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 11:19:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-12-02 11:19:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-12-02 11:19:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-12-02 11:19:29,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 11:19:29,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 11:19:29,902 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 11:19:29,904 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 11:19:30,468 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-12-02 11:19:30,468 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 11:19:30,479 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 11:19:30,479 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 11:19:30,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:19:30 BoogieIcfgContainer [2024-12-02 11:19:30,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 11:19:30,482 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 11:19:30,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 11:19:30,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 11:19:30,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:19:29" (1/3) ... [2024-12-02 11:19:30,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31977aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:19:30, skipping insertion in model container [2024-12-02 11:19:30,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:19:29" (2/3) ... [2024-12-02 11:19:30,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31977aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:19:30, skipping insertion in model container [2024-12-02 11:19:30,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:19:30" (3/3) ... [2024-12-02 11:19:30,487 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-56.i [2024-12-02 11:19:30,499 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 11:19:30,500 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-56.i that has 2 procedures, 126 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 11:19:30,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:19:30,556 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;@6b7a5177, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:19:30,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 11:19:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-12-02 11:19:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-02 11:19:30,569 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:30,570 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:30,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:30,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash -70143542, now seen corresponding path program 1 times [2024-12-02 11:19:30,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:30,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322266378] [2024-12-02 11:19:30,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:30,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-12-02 11:19:30,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:30,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322266378] [2024-12-02 11:19:30,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322266378] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:19:30,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238854955] [2024-12-02 11:19:30,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:30,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:19:30,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:19:30,850 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:19:30,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 11:19:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:31,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-12-02 11:19:31,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:19:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-12-02 11:19:31,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:19:31,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238854955] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:31,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:19:31,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-12-02 11:19:31,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041581820] [2024-12-02 11:19:31,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:31,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 11:19:31,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:31,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 11:19:31,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 11:19:31,169 INFO L87 Difference]: Start difference. First operand has 126 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:19:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:31,196 INFO L93 Difference]: Finished difference Result 245 states and 387 transitions. [2024-12-02 11:19:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 11:19:31,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-12-02 11:19:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:31,203 INFO L225 Difference]: With dead ends: 245 [2024-12-02 11:19:31,203 INFO L226 Difference]: Without dead ends: 122 [2024-12-02 11:19:31,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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-12-02 11:19:31,209 INFO L435 NwaCegarLoop]: 180 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, 180 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-12-02 11:19:31,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:19:31,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-12-02 11:19:31,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-12-02 11:19:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-12-02 11:19:31,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2024-12-02 11:19:31,243 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2024-12-02 11:19:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:31,243 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2024-12-02 11:19:31,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:19:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2024-12-02 11:19:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-02 11:19:31,246 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:31,246 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:31,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 11:19:31,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:19:31,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:31,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:31,448 INFO L85 PathProgramCache]: Analyzing trace with hash 155255632, now seen corresponding path program 1 times [2024-12-02 11:19:31,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:31,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319463845] [2024-12-02 11:19:31,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:31,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:31,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:31,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319463845] [2024-12-02 11:19:31,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319463845] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:31,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:31,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:19:31,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830417990] [2024-12-02 11:19:31,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:31,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:19:31,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:31,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:19:31,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:19:31,673 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:31,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:31,705 INFO L93 Difference]: Finished difference Result 242 states and 359 transitions. [2024-12-02 11:19:31,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:19:31,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-12-02 11:19:31,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:31,708 INFO L225 Difference]: With dead ends: 242 [2024-12-02 11:19:31,708 INFO L226 Difference]: Without dead ends: 123 [2024-12-02 11:19:31,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:19:31,710 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 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-12-02 11:19:31,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:19:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-12-02 11:19:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-12-02 11:19:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-12-02 11:19:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2024-12-02 11:19:31,722 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 151 [2024-12-02 11:19:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:31,723 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2024-12-02 11:19:31,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2024-12-02 11:19:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-02 11:19:31,726 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:31,726 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:31,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 11:19:31,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:31,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:31,727 INFO L85 PathProgramCache]: Analyzing trace with hash -662392818, now seen corresponding path program 1 times [2024-12-02 11:19:31,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:31,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040454572] [2024-12-02 11:19:31,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:31,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:34,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:34,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040454572] [2024-12-02 11:19:34,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040454572] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:34,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:34,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-12-02 11:19:34,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020123467] [2024-12-02 11:19:34,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:34,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 11:19:34,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:34,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 11:19:34,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-12-02 11:19:34,074 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:19:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:36,021 INFO L93 Difference]: Finished difference Result 725 states and 1076 transitions. [2024-12-02 11:19:36,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-02 11:19:36,022 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-12-02 11:19:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:36,026 INFO L225 Difference]: With dead ends: 725 [2024-12-02 11:19:36,027 INFO L226 Difference]: Without dead ends: 605 [2024-12-02 11:19:36,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2024-12-02 11:19:36,029 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 890 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 2797 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:36,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 2797 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-12-02 11:19:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-12-02 11:19:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 382. [2024-12-02 11:19:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 331 states have (on average 1.4501510574018126) internal successors, (480), 332 states have internal predecessors, (480), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-12-02 11:19:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 574 transitions. [2024-12-02 11:19:36,084 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 574 transitions. Word has length 151 [2024-12-02 11:19:36,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:36,084 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 574 transitions. [2024-12-02 11:19:36,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:19:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 574 transitions. [2024-12-02 11:19:36,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-02 11:19:36,087 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:36,087 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:36,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 11:19:36,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:36,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:36,089 INFO L85 PathProgramCache]: Analyzing trace with hash 439138535, now seen corresponding path program 1 times [2024-12-02 11:19:36,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:36,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266986830] [2024-12-02 11:19:36,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:36,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:36,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:36,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266986830] [2024-12-02 11:19:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266986830] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:36,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:36,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:19:36,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890046851] [2024-12-02 11:19:36,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:36,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:19:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:36,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:19:36,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:19:36,222 INFO L87 Difference]: Start difference. First operand 382 states and 574 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:36,260 INFO L93 Difference]: Finished difference Result 758 states and 1141 transitions. [2024-12-02 11:19:36,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:19:36,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-12-02 11:19:36,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:36,265 INFO L225 Difference]: With dead ends: 758 [2024-12-02 11:19:36,265 INFO L226 Difference]: Without dead ends: 379 [2024-12-02 11:19:36,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:19:36,267 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:36,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:19:36,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-12-02 11:19:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-12-02 11:19:36,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 328 states have (on average 1.4451219512195121) internal successors, (474), 329 states have internal predecessors, (474), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-12-02 11:19:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 568 transitions. [2024-12-02 11:19:36,296 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 568 transitions. Word has length 152 [2024-12-02 11:19:36,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:36,296 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 568 transitions. [2024-12-02 11:19:36,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 568 transitions. [2024-12-02 11:19:36,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-02 11:19:36,299 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:36,299 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:36,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 11:19:36,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:36,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:36,300 INFO L85 PathProgramCache]: Analyzing trace with hash -234426631, now seen corresponding path program 1 times [2024-12-02 11:19:36,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:36,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846948428] [2024-12-02 11:19:36,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:36,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:36,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:36,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846948428] [2024-12-02 11:19:36,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846948428] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:36,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:36,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:19:36,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608570879] [2024-12-02 11:19:36,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:36,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:19:36,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:36,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:19:36,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:19:36,421 INFO L87 Difference]: Start difference. First operand 379 states and 568 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:36,461 INFO L93 Difference]: Finished difference Result 760 states and 1143 transitions. [2024-12-02 11:19:36,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:19:36,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-12-02 11:19:36,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:36,465 INFO L225 Difference]: With dead ends: 760 [2024-12-02 11:19:36,465 INFO L226 Difference]: Without dead ends: 384 [2024-12-02 11:19:36,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:19:36,467 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:36,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:19:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-12-02 11:19:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-12-02 11:19:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 333 states have (on average 1.4384384384384385) internal successors, (479), 334 states have internal predecessors, (479), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-12-02 11:19:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 573 transitions. [2024-12-02 11:19:36,495 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 573 transitions. Word has length 152 [2024-12-02 11:19:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:36,496 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 573 transitions. [2024-12-02 11:19:36,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 573 transitions. [2024-12-02 11:19:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-02 11:19:36,498 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:36,498 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:36,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 11:19:36,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:36,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:36,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1910188739, now seen corresponding path program 1 times [2024-12-02 11:19:36,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:36,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031791039] [2024-12-02 11:19:36,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:36,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:36,595 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:36,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:36,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031791039] [2024-12-02 11:19:36,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031791039] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:36,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:36,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:19:36,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880719236] [2024-12-02 11:19:36,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:36,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:19:36,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:36,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:19:36,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:19:36,597 INFO L87 Difference]: Start difference. First operand 384 states and 573 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:36,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:36,642 INFO L93 Difference]: Finished difference Result 760 states and 1135 transitions. [2024-12-02 11:19:36,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:19:36,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2024-12-02 11:19:36,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:36,646 INFO L225 Difference]: With dead ends: 760 [2024-12-02 11:19:36,646 INFO L226 Difference]: Without dead ends: 379 [2024-12-02 11:19:36,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:19:36,647 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:36,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:19:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-12-02 11:19:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-12-02 11:19:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 328 states have (on average 1.4298780487804879) internal successors, (469), 329 states have internal predecessors, (469), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-12-02 11:19:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 563 transitions. [2024-12-02 11:19:36,677 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 563 transitions. Word has length 152 [2024-12-02 11:19:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:36,678 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 563 transitions. [2024-12-02 11:19:36,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 563 transitions. [2024-12-02 11:19:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-02 11:19:36,680 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:36,680 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:36,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 11:19:36,680 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:36,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:36,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2133860781, now seen corresponding path program 1 times [2024-12-02 11:19:36,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:36,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742109089] [2024-12-02 11:19:36,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:36,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-12-02 11:19:36,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:36,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742109089] [2024-12-02 11:19:36,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742109089] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:19:36,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955614238] [2024-12-02 11:19:36,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:36,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:19:36,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:19:36,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:19:36,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 11:19:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:37,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 11:19:37,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:19:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:37,262 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:19:37,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955614238] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:37,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:19:37,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-12-02 11:19:37,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608390087] [2024-12-02 11:19:37,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:37,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:19:37,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:37,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:19:37,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:19:37,264 INFO L87 Difference]: Start difference. First operand 379 states and 563 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:37,310 INFO L93 Difference]: Finished difference Result 764 states and 1135 transitions. [2024-12-02 11:19:37,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:19:37,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-12-02 11:19:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:37,314 INFO L225 Difference]: With dead ends: 764 [2024-12-02 11:19:37,314 INFO L226 Difference]: Without dead ends: 388 [2024-12-02 11:19:37,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:19:37,316 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:37,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 691 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:19:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-12-02 11:19:37,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-12-02 11:19:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 337 states have (on average 1.4183976261127595) internal successors, (478), 338 states have internal predecessors, (478), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-12-02 11:19:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 572 transitions. [2024-12-02 11:19:37,346 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 572 transitions. Word has length 153 [2024-12-02 11:19:37,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:37,347 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 572 transitions. [2024-12-02 11:19:37,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 572 transitions. [2024-12-02 11:19:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-02 11:19:37,349 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:37,350 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:37,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-12-02 11:19:37,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:19:37,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:37,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1297495016, now seen corresponding path program 1 times [2024-12-02 11:19:37,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:37,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364548331] [2024-12-02 11:19:37,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:37,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:39,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:39,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364548331] [2024-12-02 11:19:39,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364548331] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:39,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:39,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 11:19:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919741946] [2024-12-02 11:19:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:39,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 11:19:39,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:39,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 11:19:39,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:19:39,272 INFO L87 Difference]: Start difference. First operand 388 states and 572 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:40,147 INFO L93 Difference]: Finished difference Result 986 states and 1455 transitions. [2024-12-02 11:19:40,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:19:40,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-12-02 11:19:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:40,152 INFO L225 Difference]: With dead ends: 986 [2024-12-02 11:19:40,152 INFO L226 Difference]: Without dead ends: 601 [2024-12-02 11:19:40,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-12-02 11:19:40,153 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 465 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:40,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 726 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 11:19:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-12-02 11:19:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 527. [2024-12-02 11:19:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 466 states have (on average 1.4356223175965666) internal successors, (669), 468 states have internal predecessors, (669), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-12-02 11:19:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 781 transitions. [2024-12-02 11:19:40,215 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 781 transitions. Word has length 153 [2024-12-02 11:19:40,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:40,216 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 781 transitions. [2024-12-02 11:19:40,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 781 transitions. [2024-12-02 11:19:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-02 11:19:40,219 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:40,219 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:40,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 11:19:40,219 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:40,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:40,220 INFO L85 PathProgramCache]: Analyzing trace with hash 17631338, now seen corresponding path program 1 times [2024-12-02 11:19:40,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:40,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416592175] [2024-12-02 11:19:40,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:40,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:41,791 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:41,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:41,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416592175] [2024-12-02 11:19:41,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416592175] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:41,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:41,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-12-02 11:19:41,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566441736] [2024-12-02 11:19:41,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:41,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 11:19:41,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:41,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 11:19:41,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-12-02 11:19:41,794 INFO L87 Difference]: Start difference. First operand 527 states and 781 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:43,214 INFO L93 Difference]: Finished difference Result 1691 states and 2483 transitions. [2024-12-02 11:19:43,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 11:19:43,215 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-12-02 11:19:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:43,221 INFO L225 Difference]: With dead ends: 1691 [2024-12-02 11:19:43,221 INFO L226 Difference]: Without dead ends: 1167 [2024-12-02 11:19:43,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2024-12-02 11:19:43,223 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 971 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:43,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1428 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 11:19:43,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2024-12-02 11:19:43,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 778. [2024-12-02 11:19:43,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 669 states have (on average 1.4035874439461884) internal successors, (939), 673 states have internal predecessors, (939), 97 states have call successors, (97), 11 states have call predecessors, (97), 11 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-12-02 11:19:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1133 transitions. [2024-12-02 11:19:43,319 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1133 transitions. Word has length 153 [2024-12-02 11:19:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:43,320 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 1133 transitions. [2024-12-02 11:19:43,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1133 transitions. [2024-12-02 11:19:43,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-02 11:19:43,323 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:43,323 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:43,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 11:19:43,323 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:43,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:43,324 INFO L85 PathProgramCache]: Analyzing trace with hash -569174676, now seen corresponding path program 1 times [2024-12-02 11:19:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:43,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656455876] [2024-12-02 11:19:43,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:43,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:44,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:44,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656455876] [2024-12-02 11:19:44,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656455876] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:44,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:44,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 11:19:44,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066321614] [2024-12-02 11:19:44,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:44,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 11:19:44,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:44,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 11:19:44,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:19:44,436 INFO L87 Difference]: Start difference. First operand 778 states and 1133 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:44,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:44,975 INFO L93 Difference]: Finished difference Result 1499 states and 2193 transitions. [2024-12-02 11:19:44,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:19:44,975 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-12-02 11:19:44,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:44,980 INFO L225 Difference]: With dead ends: 1499 [2024-12-02 11:19:44,980 INFO L226 Difference]: Without dead ends: 827 [2024-12-02 11:19:44,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:19:44,982 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 266 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:44,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 668 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 11:19:44,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-12-02 11:19:45,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 776. [2024-12-02 11:19:45,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 668 states have (on average 1.401197604790419) internal successors, (936), 673 states have internal predecessors, (936), 97 states have call successors, (97), 10 states have call predecessors, (97), 10 states have return successors, (97), 92 states have call predecessors, (97), 97 states have call successors, (97) [2024-12-02 11:19:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1130 transitions. [2024-12-02 11:19:45,064 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1130 transitions. Word has length 153 [2024-12-02 11:19:45,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:45,064 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1130 transitions. [2024-12-02 11:19:45,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1130 transitions. [2024-12-02 11:19:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-02 11:19:45,067 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:45,067 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:45,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 11:19:45,067 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:45,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash 561773252, now seen corresponding path program 1 times [2024-12-02 11:19:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:45,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009967375] [2024-12-02 11:19:45,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:45,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:45,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:45,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009967375] [2024-12-02 11:19:45,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009967375] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:45,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:45,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:19:45,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119015201] [2024-12-02 11:19:45,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:45,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:19:45,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:45,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:19:45,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:19:45,190 INFO L87 Difference]: Start difference. First operand 776 states and 1130 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:45,308 INFO L93 Difference]: Finished difference Result 1518 states and 2218 transitions. [2024-12-02 11:19:45,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:19:45,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-12-02 11:19:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:45,311 INFO L225 Difference]: With dead ends: 1518 [2024-12-02 11:19:45,312 INFO L226 Difference]: Without dead ends: 801 [2024-12-02 11:19:45,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-02 11:19:45,314 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 78 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:45,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 642 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:19:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-12-02 11:19:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 761. [2024-12-02 11:19:45,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 653 states have (on average 1.3889739663093414) internal successors, (907), 658 states have internal predecessors, (907), 97 states have call successors, (97), 10 states have call predecessors, (97), 10 states have return successors, (97), 92 states have call predecessors, (97), 97 states have call successors, (97) [2024-12-02 11:19:45,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1101 transitions. [2024-12-02 11:19:45,370 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1101 transitions. Word has length 153 [2024-12-02 11:19:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:45,371 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1101 transitions. [2024-12-02 11:19:45,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:45,371 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1101 transitions. [2024-12-02 11:19:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-02 11:19:45,372 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:45,372 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:45,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 11:19:45,373 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:45,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:45,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1542718732, now seen corresponding path program 1 times [2024-12-02 11:19:45,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:45,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623245127] [2024-12-02 11:19:45,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:45,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:47,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:47,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623245127] [2024-12-02 11:19:47,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623245127] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:47,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:47,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-12-02 11:19:47,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167405824] [2024-12-02 11:19:47,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:47,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 11:19:47,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:47,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 11:19:47,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-12-02 11:19:47,950 INFO L87 Difference]: Start difference. First operand 761 states and 1101 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:49,861 INFO L93 Difference]: Finished difference Result 1974 states and 2873 transitions. [2024-12-02 11:19:49,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 11:19:49,861 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-12-02 11:19:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:49,865 INFO L225 Difference]: With dead ends: 1974 [2024-12-02 11:19:49,866 INFO L226 Difference]: Without dead ends: 1272 [2024-12-02 11:19:49,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2024-12-02 11:19:49,868 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 342 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:49,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1655 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-12-02 11:19:49,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2024-12-02 11:19:49,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 808. [2024-12-02 11:19:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 700 states have (on average 1.3957142857142857) internal successors, (977), 704 states have internal predecessors, (977), 97 states have call successors, (97), 10 states have call predecessors, (97), 10 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-12-02 11:19:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1171 transitions. [2024-12-02 11:19:49,955 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1171 transitions. Word has length 153 [2024-12-02 11:19:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:49,956 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1171 transitions. [2024-12-02 11:19:49,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1171 transitions. [2024-12-02 11:19:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-02 11:19:49,958 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:49,958 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:49,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 11:19:49,958 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:49,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:49,959 INFO L85 PathProgramCache]: Analyzing trace with hash 788021926, now seen corresponding path program 1 times [2024-12-02 11:19:49,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:49,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511131783] [2024-12-02 11:19:49,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:49,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:51,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:51,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511131783] [2024-12-02 11:19:51,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511131783] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:51,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:51,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 11:19:51,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512602754] [2024-12-02 11:19:51,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:51,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 11:19:51,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:51,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 11:19:51,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-12-02 11:19:51,075 INFO L87 Difference]: Start difference. First operand 808 states and 1171 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:51,932 INFO L93 Difference]: Finished difference Result 2014 states and 2928 transitions. [2024-12-02 11:19:51,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 11:19:51,932 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-12-02 11:19:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:51,936 INFO L225 Difference]: With dead ends: 2014 [2024-12-02 11:19:51,936 INFO L226 Difference]: Without dead ends: 1312 [2024-12-02 11:19:51,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-12-02 11:19:51,938 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 526 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:51,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1128 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 11:19:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-12-02 11:19:51,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 846. [2024-12-02 11:19:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 738 states have (on average 1.4024390243902438) internal successors, (1035), 742 states have internal predecessors, (1035), 97 states have call successors, (97), 10 states have call predecessors, (97), 10 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-12-02 11:19:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1229 transitions. [2024-12-02 11:19:51,990 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1229 transitions. Word has length 153 [2024-12-02 11:19:51,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:51,990 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1229 transitions. [2024-12-02 11:19:51,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1229 transitions. [2024-12-02 11:19:51,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-02 11:19:51,992 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:51,992 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:51,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 11:19:51,992 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:51,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:51,992 INFO L85 PathProgramCache]: Analyzing trace with hash -491841752, now seen corresponding path program 1 times [2024-12-02 11:19:51,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:51,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110537800] [2024-12-02 11:19:51,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:51,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:52,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:52,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110537800] [2024-12-02 11:19:52,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110537800] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:52,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:52,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-12-02 11:19:52,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127417107] [2024-12-02 11:19:52,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:52,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 11:19:52,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:52,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 11:19:52,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-12-02 11:19:52,927 INFO L87 Difference]: Start difference. First operand 846 states and 1229 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:54,064 INFO L93 Difference]: Finished difference Result 2084 states and 3020 transitions. [2024-12-02 11:19:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 11:19:54,065 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-12-02 11:19:54,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:54,079 INFO L225 Difference]: With dead ends: 2084 [2024-12-02 11:19:54,079 INFO L226 Difference]: Without dead ends: 1382 [2024-12-02 11:19:54,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2024-12-02 11:19:54,082 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 850 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:54,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1400 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 11:19:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-12-02 11:19:54,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 853. [2024-12-02 11:19:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 745 states have (on average 1.4013422818791947) internal successors, (1044), 749 states have internal predecessors, (1044), 97 states have call successors, (97), 10 states have call predecessors, (97), 10 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-12-02 11:19:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1238 transitions. [2024-12-02 11:19:54,188 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1238 transitions. Word has length 153 [2024-12-02 11:19:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:54,188 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1238 transitions. [2024-12-02 11:19:54,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1238 transitions. [2024-12-02 11:19:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-02 11:19:54,190 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:54,190 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:54,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 11:19:54,191 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:54,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1078647766, now seen corresponding path program 1 times [2024-12-02 11:19:54,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:54,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198253984] [2024-12-02 11:19:54,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:54,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:55,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:55,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198253984] [2024-12-02 11:19:55,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198253984] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:55,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:55,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 11:19:55,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759605250] [2024-12-02 11:19:55,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:55,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 11:19:55,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:55,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 11:19:55,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:19:55,403 INFO L87 Difference]: Start difference. First operand 853 states and 1238 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:56,015 INFO L93 Difference]: Finished difference Result 1826 states and 2646 transitions. [2024-12-02 11:19:56,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:19:56,016 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-12-02 11:19:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:56,019 INFO L225 Difference]: With dead ends: 1826 [2024-12-02 11:19:56,019 INFO L226 Difference]: Without dead ends: 1122 [2024-12-02 11:19:56,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-12-02 11:19:56,021 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 451 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:56,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 947 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 11:19:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-12-02 11:19:56,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 932. [2024-12-02 11:19:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 814 states have (on average 1.4017199017199018) internal successors, (1141), 819 states have internal predecessors, (1141), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-12-02 11:19:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1353 transitions. [2024-12-02 11:19:56,116 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1353 transitions. Word has length 153 [2024-12-02 11:19:56,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:56,116 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1353 transitions. [2024-12-02 11:19:56,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1353 transitions. [2024-12-02 11:19:56,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-02 11:19:56,118 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:56,118 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:56,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 11:19:56,118 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:56,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:56,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2052191822, now seen corresponding path program 1 times [2024-12-02 11:19:56,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:56,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772980181] [2024-12-02 11:19:56,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:56,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:56,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:56,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772980181] [2024-12-02 11:19:56,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772980181] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:56,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:56,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:19:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471821517] [2024-12-02 11:19:56,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:56,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:19:56,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:56,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:19:56,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:19:56,310 INFO L87 Difference]: Start difference. First operand 932 states and 1353 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:56,465 INFO L93 Difference]: Finished difference Result 1720 states and 2500 transitions. [2024-12-02 11:19:56,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:19:56,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-12-02 11:19:56,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:56,469 INFO L225 Difference]: With dead ends: 1720 [2024-12-02 11:19:56,469 INFO L226 Difference]: Without dead ends: 932 [2024-12-02 11:19:56,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-02 11:19:56,470 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 4 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 624 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.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:56,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 624 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:19:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-12-02 11:19:56,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2024-12-02 11:19:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 814 states have (on average 1.3992628992628993) internal successors, (1139), 819 states have internal predecessors, (1139), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-12-02 11:19:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1351 transitions. [2024-12-02 11:19:56,524 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1351 transitions. Word has length 153 [2024-12-02 11:19:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:56,524 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1351 transitions. [2024-12-02 11:19:56,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1351 transitions. [2024-12-02 11:19:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-02 11:19:56,525 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:56,526 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:56,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 11:19:56,526 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:56,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:56,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1990152208, now seen corresponding path program 1 times [2024-12-02 11:19:56,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:56,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438276705] [2024-12-02 11:19:56,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:56,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:57,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:57,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438276705] [2024-12-02 11:19:57,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438276705] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:57,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:57,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 11:19:57,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446505797] [2024-12-02 11:19:57,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:57,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 11:19:57,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:57,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 11:19:57,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:19:57,793 INFO L87 Difference]: Start difference. First operand 932 states and 1351 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:58,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:19:58,695 INFO L93 Difference]: Finished difference Result 1853 states and 2684 transitions. [2024-12-02 11:19:58,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:19:58,696 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-12-02 11:19:58,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:19:58,699 INFO L225 Difference]: With dead ends: 1853 [2024-12-02 11:19:58,699 INFO L226 Difference]: Without dead ends: 1065 [2024-12-02 11:19:58,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-12-02 11:19:58,700 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 338 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 11:19:58,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 971 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 11:19:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-12-02 11:19:58,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 936. [2024-12-02 11:19:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 818 states have (on average 1.3985330073349633) internal successors, (1144), 823 states have internal predecessors, (1144), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-12-02 11:19:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1356 transitions. [2024-12-02 11:19:58,779 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1356 transitions. Word has length 153 [2024-12-02 11:19:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:19:58,779 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1356 transitions. [2024-12-02 11:19:58,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:19:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1356 transitions. [2024-12-02 11:19:58,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-02 11:19:58,781 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:19:58,781 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:19:58,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 11:19:58,781 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:19:58,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:19:58,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1718009074, now seen corresponding path program 1 times [2024-12-02 11:19:58,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:19:58,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860963918] [2024-12-02 11:19:58,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:19:58,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:19:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:19:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:19:59,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:19:59,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860963918] [2024-12-02 11:19:59,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860963918] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:19:59,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:19:59,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 11:19:59,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007548062] [2024-12-02 11:19:59,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:19:59,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 11:19:59,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:19:59,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 11:19:59,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:19:59,606 INFO L87 Difference]: Start difference. First operand 936 states and 1356 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:20:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:20:00,305 INFO L93 Difference]: Finished difference Result 1857 states and 2687 transitions. [2024-12-02 11:20:00,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:20:00,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-12-02 11:20:00,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:20:00,308 INFO L225 Difference]: With dead ends: 1857 [2024-12-02 11:20:00,308 INFO L226 Difference]: Without dead ends: 1065 [2024-12-02 11:20:00,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-12-02 11:20:00,310 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 245 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-12-02 11:20:00,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1184 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-12-02 11:20:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-12-02 11:20:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 935. [2024-12-02 11:20:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 817 states have (on average 1.397796817625459) internal successors, (1142), 822 states have internal predecessors, (1142), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-12-02 11:20:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1354 transitions. [2024-12-02 11:20:00,368 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1354 transitions. Word has length 153 [2024-12-02 11:20:00,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:20:00,368 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1354 transitions. [2024-12-02 11:20:00,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:20:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1354 transitions. [2024-12-02 11:20:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-02 11:20:00,369 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:20:00,369 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:20:00,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 11:20:00,369 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:20:00,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash 412170648, now seen corresponding path program 1 times [2024-12-02 11:20:00,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:00,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176079523] [2024-12-02 11:20:00,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:00,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:20:00,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:00,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176079523] [2024-12-02 11:20:00,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176079523] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:00,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:00,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:20:00,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108847443] [2024-12-02 11:20:00,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:00,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:20:00,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:00,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:20:00,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:20:00,498 INFO L87 Difference]: Start difference. First operand 935 states and 1354 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:20:00,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:20:00,620 INFO L93 Difference]: Finished difference Result 1726 states and 2501 transitions. [2024-12-02 11:20:00,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:20:00,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-12-02 11:20:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:20:00,623 INFO L225 Difference]: With dead ends: 1726 [2024-12-02 11:20:00,624 INFO L226 Difference]: Without dead ends: 935 [2024-12-02 11:20:00,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-02 11:20:00,625 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 81 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:20:00,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 786 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:20:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-12-02 11:20:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 933. [2024-12-02 11:20:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 815 states have (on average 1.396319018404908) internal successors, (1138), 820 states have internal predecessors, (1138), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-12-02 11:20:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1350 transitions. [2024-12-02 11:20:00,683 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1350 transitions. Word has length 153 [2024-12-02 11:20:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:20:00,683 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1350 transitions. [2024-12-02 11:20:00,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:20:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1350 transitions. [2024-12-02 11:20:00,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-12-02 11:20:00,685 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:20:00,685 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:20:00,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 11:20:00,685 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:20:00,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash 254682777, now seen corresponding path program 1 times [2024-12-02 11:20:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:00,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248399357] [2024-12-02 11:20:00,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:00,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:20:00,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:00,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248399357] [2024-12-02 11:20:00,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248399357] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:00,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:00,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:20:00,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948907497] [2024-12-02 11:20:00,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:00,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:20:00,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:00,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:20:00,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:00,759 INFO L87 Difference]: Start difference. First operand 933 states and 1350 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:20:00,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:20:00,902 INFO L93 Difference]: Finished difference Result 1712 states and 2478 transitions. [2024-12-02 11:20:00,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:20:00,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2024-12-02 11:20:00,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:20:00,907 INFO L225 Difference]: With dead ends: 1712 [2024-12-02 11:20:00,907 INFO L226 Difference]: Without dead ends: 923 [2024-12-02 11:20:00,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:20:00,909 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:20:00,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:20:00,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-12-02 11:20:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2024-12-02 11:20:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 805 states have (on average 1.391304347826087) internal successors, (1120), 810 states have internal predecessors, (1120), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-12-02 11:20:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1332 transitions. [2024-12-02 11:20:00,985 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1332 transitions. Word has length 154 [2024-12-02 11:20:00,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:20:00,985 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1332 transitions. [2024-12-02 11:20:00,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:20:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1332 transitions. [2024-12-02 11:20:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:20:00,987 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:20:00,987 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:20:00,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 11:20:00,987 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:20:00,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:00,988 INFO L85 PathProgramCache]: Analyzing trace with hash -301787730, now seen corresponding path program 1 times [2024-12-02 11:20:00,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:00,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927114541] [2024-12-02 11:20:00,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:00,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:20:01,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:01,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927114541] [2024-12-02 11:20:01,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927114541] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:01,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:01,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 11:20:01,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3514164] [2024-12-02 11:20:01,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:01,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 11:20:01,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:01,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 11:20:01,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:20:01,447 INFO L87 Difference]: Start difference. First operand 923 states and 1332 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:20:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:20:01,896 INFO L93 Difference]: Finished difference Result 2079 states and 3002 transitions. [2024-12-02 11:20:01,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 11:20:01,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-12-02 11:20:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:20:01,901 INFO L225 Difference]: With dead ends: 2079 [2024-12-02 11:20:01,901 INFO L226 Difference]: Without dead ends: 1300 [2024-12-02 11:20:01,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-12-02 11:20:01,903 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 296 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:20:01,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 998 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:20:01,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2024-12-02 11:20:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1069. [2024-12-02 11:20:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 951 states have (on average 1.401682439537329) internal successors, (1333), 956 states have internal predecessors, (1333), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-12-02 11:20:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1545 transitions. [2024-12-02 11:20:01,991 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1545 transitions. Word has length 155 [2024-12-02 11:20:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:20:01,992 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1545 transitions. [2024-12-02 11:20:01,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:20:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1545 transitions. [2024-12-02 11:20:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:20:01,992 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:20:01,992 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:20:01,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 11:20:01,993 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:20:01,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:01,993 INFO L85 PathProgramCache]: Analyzing trace with hash -239748116, now seen corresponding path program 1 times [2024-12-02 11:20:01,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:01,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067084765] [2024-12-02 11:20:01,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:01,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:20:02,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:02,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067084765] [2024-12-02 11:20:02,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067084765] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:02,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:02,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-12-02 11:20:02,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242240088] [2024-12-02 11:20:02,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:02,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 11:20:02,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:02,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 11:20:02,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-12-02 11:20:02,768 INFO L87 Difference]: Start difference. First operand 1069 states and 1545 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:20:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:20:03,953 INFO L93 Difference]: Finished difference Result 2427 states and 3492 transitions. [2024-12-02 11:20:03,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 11:20:03,953 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-12-02 11:20:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:20:03,957 INFO L225 Difference]: With dead ends: 2427 [2024-12-02 11:20:03,957 INFO L226 Difference]: Without dead ends: 1502 [2024-12-02 11:20:03,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2024-12-02 11:20:03,959 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 491 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 11:20:03,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1804 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 11:20:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2024-12-02 11:20:04,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1106. [2024-12-02 11:20:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 988 states have (on average 1.4018218623481782) internal successors, (1385), 993 states have internal predecessors, (1385), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-12-02 11:20:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1597 transitions. [2024-12-02 11:20:04,025 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1597 transitions. Word has length 155 [2024-12-02 11:20:04,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:20:04,025 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1597 transitions. [2024-12-02 11:20:04,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:20:04,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1597 transitions. [2024-12-02 11:20:04,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:20:04,026 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:20:04,026 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:20:04,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 11:20:04,027 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:20:04,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:20:04,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1412848974, now seen corresponding path program 1 times [2024-12-02 11:20:04,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:20:04,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326094218] [2024-12-02 11:20:04,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:20:04,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:20:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:20:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:20:29,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:20:29,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326094218] [2024-12-02 11:20:29,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326094218] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:20:29,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:20:29,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-12-02 11:20:29,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507386666] [2024-12-02 11:20:29,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:20:29,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-12-02 11:20:29,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:20:29,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-12-02 11:20:29,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2024-12-02 11:20:29,449 INFO L87 Difference]: Start difference. First operand 1106 states and 1597 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:21:00,194 WARN L286 SmtUtils]: Spent 28.03s on a formula simplification. DAG size of input: 147 DAG size of output: 108 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-02 11:21:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:05,437 INFO L93 Difference]: Finished difference Result 2400 states and 3457 transitions. [2024-12-02 11:21:05,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-12-02 11:21:05,438 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-12-02 11:21:05,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:05,441 INFO L225 Difference]: With dead ends: 2400 [2024-12-02 11:21:05,441 INFO L226 Difference]: Without dead ends: 1475 [2024-12-02 11:21:05,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=362, Invalid=1990, Unknown=0, NotChecked=0, Total=2352 [2024-12-02 11:21:05,443 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 886 mSDsluCounter, 4422 mSDsCounter, 0 mSdLazyCounter, 2925 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 4734 SdHoareTripleChecker+Invalid, 3086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 2925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:05,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 4734 Invalid, 3086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 2925 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-12-02 11:21:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2024-12-02 11:21:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1193. [2024-12-02 11:21:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1075 states have (on average 1.4083720930232557) internal successors, (1514), 1080 states have internal predecessors, (1514), 106 states have call successors, (106), 11 states have call predecessors, (106), 11 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-12-02 11:21:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1726 transitions. [2024-12-02 11:21:05,513 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1726 transitions. Word has length 155 [2024-12-02 11:21:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:05,513 INFO L471 AbstractCegarLoop]: Abstraction has 1193 states and 1726 transitions. [2024-12-02 11:21:05,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:21:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1726 transitions. [2024-12-02 11:21:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:21:05,514 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:05,514 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:05,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 11:21:05,514 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:05,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:05,514 INFO L85 PathProgramCache]: Analyzing trace with hash 826042960, now seen corresponding path program 1 times [2024-12-02 11:21:05,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:05,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337281228] [2024-12-02 11:21:05,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:05,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:06,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:06,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337281228] [2024-12-02 11:21:06,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337281228] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:06,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:06,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 11:21:06,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372841069] [2024-12-02 11:21:06,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:06,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 11:21:06,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:06,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 11:21:06,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:21:06,071 INFO L87 Difference]: Start difference. First operand 1193 states and 1726 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:06,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:06,766 INFO L93 Difference]: Finished difference Result 2527 states and 3628 transitions. [2024-12-02 11:21:06,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:21:06,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-12-02 11:21:06,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:06,771 INFO L225 Difference]: With dead ends: 2527 [2024-12-02 11:21:06,771 INFO L226 Difference]: Without dead ends: 1555 [2024-12-02 11:21:06,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-12-02 11:21:06,773 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 303 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:06,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 865 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 11:21:06,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2024-12-02 11:21:06,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1269. [2024-12-02 11:21:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1138 states have (on average 1.3963093145869947) internal successors, (1589), 1144 states have internal predecessors, (1589), 117 states have call successors, (117), 13 states have call predecessors, (117), 13 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2024-12-02 11:21:06,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1823 transitions. [2024-12-02 11:21:06,867 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1823 transitions. Word has length 155 [2024-12-02 11:21:06,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:06,867 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 1823 transitions. [2024-12-02 11:21:06,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:06,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1823 transitions. [2024-12-02 11:21:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:21:06,868 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:06,868 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:06,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 11:21:06,869 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:06,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:06,869 INFO L85 PathProgramCache]: Analyzing trace with hash 903375884, now seen corresponding path program 1 times [2024-12-02 11:21:06,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:06,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134812650] [2024-12-02 11:21:06,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:06,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:07,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:07,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134812650] [2024-12-02 11:21:07,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134812650] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:07,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:07,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:21:07,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027950509] [2024-12-02 11:21:07,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:07,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:21:07,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:07,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:21:07,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:21:07,097 INFO L87 Difference]: Start difference. First operand 1269 states and 1823 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:07,346 INFO L93 Difference]: Finished difference Result 2296 states and 3297 transitions. [2024-12-02 11:21:07,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:21:07,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-12-02 11:21:07,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:07,350 INFO L225 Difference]: With dead ends: 2296 [2024-12-02 11:21:07,350 INFO L226 Difference]: Without dead ends: 1208 [2024-12-02 11:21:07,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-02 11:21:07,351 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 51 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:07,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 587 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:21:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2024-12-02 11:21:07,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1208. [2024-12-02 11:21:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 1077 states have (on average 1.3881151346332405) internal successors, (1495), 1083 states have internal predecessors, (1495), 117 states have call successors, (117), 13 states have call predecessors, (117), 13 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2024-12-02 11:21:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1729 transitions. [2024-12-02 11:21:07,447 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1729 transitions. Word has length 155 [2024-12-02 11:21:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:07,448 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1729 transitions. [2024-12-02 11:21:07,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1729 transitions. [2024-12-02 11:21:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:21:07,449 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:07,449 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:07,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 11:21:07,449 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:07,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:07,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1805463764, now seen corresponding path program 1 times [2024-12-02 11:21:07,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:07,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753965054] [2024-12-02 11:21:07,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:07,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:08,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:08,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753965054] [2024-12-02 11:21:08,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753965054] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:08,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:08,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-12-02 11:21:08,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375156504] [2024-12-02 11:21:08,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:08,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 11:21:08,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:08,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 11:21:08,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-12-02 11:21:08,351 INFO L87 Difference]: Start difference. First operand 1208 states and 1729 transitions. Second operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-12-02 11:21:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:09,576 INFO L93 Difference]: Finished difference Result 2652 states and 3780 transitions. [2024-12-02 11:21:09,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 11:21:09,577 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-12-02 11:21:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:09,583 INFO L225 Difference]: With dead ends: 2652 [2024-12-02 11:21:09,583 INFO L226 Difference]: Without dead ends: 1625 [2024-12-02 11:21:09,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2024-12-02 11:21:09,585 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 914 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:09,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 1903 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-12-02 11:21:09,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2024-12-02 11:21:09,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1208. [2024-12-02 11:21:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 1077 states have (on average 1.3881151346332405) internal successors, (1495), 1083 states have internal predecessors, (1495), 117 states have call successors, (117), 13 states have call predecessors, (117), 13 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2024-12-02 11:21:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1729 transitions. [2024-12-02 11:21:09,671 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1729 transitions. Word has length 155 [2024-12-02 11:21:09,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:09,671 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1729 transitions. [2024-12-02 11:21:09,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-12-02 11:21:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1729 transitions. [2024-12-02 11:21:09,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:21:09,672 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:09,672 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:09,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 11:21:09,673 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:09,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:09,673 INFO L85 PathProgramCache]: Analyzing trace with hash 926008138, now seen corresponding path program 1 times [2024-12-02 11:21:09,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:09,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851124929] [2024-12-02 11:21:09,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:09,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:10,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:10,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851124929] [2024-12-02 11:21:10,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851124929] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:10,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:10,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 11:21:10,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792437394] [2024-12-02 11:21:10,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:10,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 11:21:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:10,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 11:21:10,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:21:10,310 INFO L87 Difference]: Start difference. First operand 1208 states and 1729 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:10,778 INFO L93 Difference]: Finished difference Result 2318 states and 3305 transitions. [2024-12-02 11:21:10,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:21:10,779 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-12-02 11:21:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:10,783 INFO L225 Difference]: With dead ends: 2318 [2024-12-02 11:21:10,784 INFO L226 Difference]: Without dead ends: 1291 [2024-12-02 11:21:10,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:21:10,786 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 451 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:10,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 753 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:21:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2024-12-02 11:21:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1070. [2024-12-02 11:21:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 959 states have (on average 1.3868613138686132) internal successors, (1330), 963 states have internal predecessors, (1330), 99 states have call successors, (99), 11 states have call predecessors, (99), 11 states have return successors, (99), 95 states have call predecessors, (99), 99 states have call successors, (99) [2024-12-02 11:21:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1528 transitions. [2024-12-02 11:21:10,866 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1528 transitions. Word has length 155 [2024-12-02 11:21:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:10,866 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1528 transitions. [2024-12-02 11:21:10,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1528 transitions. [2024-12-02 11:21:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:21:10,867 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:10,867 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:10,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 11:21:10,867 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:10,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:10,867 INFO L85 PathProgramCache]: Analyzing trace with hash -353855540, now seen corresponding path program 1 times [2024-12-02 11:21:10,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:10,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533875388] [2024-12-02 11:21:10,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:10,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:11,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:11,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533875388] [2024-12-02 11:21:11,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533875388] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:11,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:11,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:21:11,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4125587] [2024-12-02 11:21:11,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:11,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:21:11,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:11,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:21:11,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:21:11,031 INFO L87 Difference]: Start difference. First operand 1070 states and 1528 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:11,296 INFO L93 Difference]: Finished difference Result 2072 states and 2951 transitions. [2024-12-02 11:21:11,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:21:11,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-12-02 11:21:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:11,301 INFO L225 Difference]: With dead ends: 2072 [2024-12-02 11:21:11,301 INFO L226 Difference]: Without dead ends: 1166 [2024-12-02 11:21:11,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-02 11:21:11,303 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 93 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:11,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 822 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:21:11,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2024-12-02 11:21:11,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1070. [2024-12-02 11:21:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 959 states have (on average 1.383733055265902) internal successors, (1327), 963 states have internal predecessors, (1327), 99 states have call successors, (99), 11 states have call predecessors, (99), 11 states have return successors, (99), 95 states have call predecessors, (99), 99 states have call successors, (99) [2024-12-02 11:21:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1525 transitions. [2024-12-02 11:21:11,400 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1525 transitions. Word has length 155 [2024-12-02 11:21:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:11,400 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1525 transitions. [2024-12-02 11:21:11,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1525 transitions. [2024-12-02 11:21:11,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:21:11,400 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:11,401 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:11,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 11:21:11,401 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:11,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:11,401 INFO L85 PathProgramCache]: Analyzing trace with hash -940661554, now seen corresponding path program 1 times [2024-12-02 11:21:11,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:11,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418729801] [2024-12-02 11:21:11,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:11,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:16,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:16,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418729801] [2024-12-02 11:21:16,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418729801] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:16,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:16,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-12-02 11:21:16,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764482898] [2024-12-02 11:21:16,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:16,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-12-02 11:21:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:16,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-12-02 11:21:16,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2024-12-02 11:21:16,141 INFO L87 Difference]: Start difference. First operand 1070 states and 1525 transitions. Second operand has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-12-02 11:21:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:20,812 INFO L93 Difference]: Finished difference Result 2398 states and 3408 transitions. [2024-12-02 11:21:20,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-12-02 11:21:20,813 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-12-02 11:21:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:20,816 INFO L225 Difference]: With dead ends: 2398 [2024-12-02 11:21:20,816 INFO L226 Difference]: Without dead ends: 1492 [2024-12-02 11:21:20,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=252, Invalid=1554, Unknown=0, NotChecked=0, Total=1806 [2024-12-02 11:21:20,818 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 477 mSDsluCounter, 2798 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 2986 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:20,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 2986 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-12-02 11:21:20,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2024-12-02 11:21:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1114. [2024-12-02 11:21:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 1003 states have (on average 1.3858424725822533) internal successors, (1390), 1007 states have internal predecessors, (1390), 99 states have call successors, (99), 11 states have call predecessors, (99), 11 states have return successors, (99), 95 states have call predecessors, (99), 99 states have call successors, (99) [2024-12-02 11:21:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1588 transitions. [2024-12-02 11:21:20,907 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1588 transitions. Word has length 155 [2024-12-02 11:21:20,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:20,908 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1588 transitions. [2024-12-02 11:21:20,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-12-02 11:21:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1588 transitions. [2024-12-02 11:21:20,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:21:20,909 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:20,909 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:20,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 11:21:20,909 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:20,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:20,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1869854258, now seen corresponding path program 1 times [2024-12-02 11:21:20,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:20,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892358168] [2024-12-02 11:21:20,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:20,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:22,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:22,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892358168] [2024-12-02 11:21:22,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892358168] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:22,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:22,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-12-02 11:21:22,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828991151] [2024-12-02 11:21:22,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:22,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 11:21:22,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:22,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 11:21:22,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-12-02 11:21:22,503 INFO L87 Difference]: Start difference. First operand 1114 states and 1588 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-12-02 11:21:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:23,986 INFO L93 Difference]: Finished difference Result 2314 states and 3299 transitions. [2024-12-02 11:21:23,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 11:21:23,987 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-12-02 11:21:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:23,990 INFO L225 Difference]: With dead ends: 2314 [2024-12-02 11:21:23,990 INFO L226 Difference]: Without dead ends: 1408 [2024-12-02 11:21:23,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2024-12-02 11:21:23,992 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 517 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:23,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 2248 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 11:21:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-12-02 11:21:24,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1263. [2024-12-02 11:21:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1140 states have (on average 1.3885964912280702) internal successors, (1583), 1145 states have internal predecessors, (1583), 110 states have call successors, (110), 12 states have call predecessors, (110), 12 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2024-12-02 11:21:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1803 transitions. [2024-12-02 11:21:24,098 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1803 transitions. Word has length 155 [2024-12-02 11:21:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:24,098 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1803 transitions. [2024-12-02 11:21:24,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-12-02 11:21:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1803 transitions. [2024-12-02 11:21:24,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:21:24,099 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:24,099 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:24,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 11:21:24,099 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:24,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1611688820, now seen corresponding path program 1 times [2024-12-02 11:21:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:24,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020090895] [2024-12-02 11:21:24,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:25,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:25,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020090895] [2024-12-02 11:21:25,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020090895] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:25,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:25,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-12-02 11:21:25,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761275537] [2024-12-02 11:21:25,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:25,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 11:21:25,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:25,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 11:21:25,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-12-02 11:21:25,207 INFO L87 Difference]: Start difference. First operand 1263 states and 1803 transitions. Second operand has 13 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-12-02 11:21:25,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:25,958 INFO L93 Difference]: Finished difference Result 2606 states and 3722 transitions. [2024-12-02 11:21:25,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:21:25,959 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-12-02 11:21:25,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:25,963 INFO L225 Difference]: With dead ends: 2606 [2024-12-02 11:21:25,963 INFO L226 Difference]: Without dead ends: 1551 [2024-12-02 11:21:25,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-12-02 11:21:25,964 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 476 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:25,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 966 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 11:21:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2024-12-02 11:21:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1325. [2024-12-02 11:21:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1202 states have (on average 1.3910149750415974) internal successors, (1672), 1207 states have internal predecessors, (1672), 110 states have call successors, (110), 12 states have call predecessors, (110), 12 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2024-12-02 11:21:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1892 transitions. [2024-12-02 11:21:26,075 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1892 transitions. Word has length 155 [2024-12-02 11:21:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:26,075 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1892 transitions. [2024-12-02 11:21:26,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-12-02 11:21:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1892 transitions. [2024-12-02 11:21:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:21:26,076 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:26,076 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:26,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 11:21:26,076 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:26,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:26,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1413995788, now seen corresponding path program 1 times [2024-12-02 11:21:26,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:26,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468015447] [2024-12-02 11:21:26,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:26,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:26,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:26,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468015447] [2024-12-02 11:21:26,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468015447] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:26,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:26,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 11:21:26,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858691759] [2024-12-02 11:21:26,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:26,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 11:21:26,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:26,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 11:21:26,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:21:26,477 INFO L87 Difference]: Start difference. First operand 1325 states and 1892 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:21:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:27,085 INFO L93 Difference]: Finished difference Result 2778 states and 3965 transitions. [2024-12-02 11:21:27,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:21:27,085 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-12-02 11:21:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:27,088 INFO L225 Difference]: With dead ends: 2778 [2024-12-02 11:21:27,088 INFO L226 Difference]: Without dead ends: 1661 [2024-12-02 11:21:27,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-12-02 11:21:27,090 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 255 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:27,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 956 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 11:21:27,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2024-12-02 11:21:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1578. [2024-12-02 11:21:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1425 states have (on average 1.3852631578947368) internal successors, (1974), 1433 states have internal predecessors, (1974), 137 states have call successors, (137), 15 states have call predecessors, (137), 15 states have return successors, (137), 129 states have call predecessors, (137), 137 states have call successors, (137) [2024-12-02 11:21:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2248 transitions. [2024-12-02 11:21:27,211 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2248 transitions. Word has length 155 [2024-12-02 11:21:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:27,212 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2248 transitions. [2024-12-02 11:21:27,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:21:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2248 transitions. [2024-12-02 11:21:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:21:27,213 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:27,213 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:27,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-02 11:21:27,213 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:27,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:27,213 INFO L85 PathProgramCache]: Analyzing trace with hash 53373776, now seen corresponding path program 1 times [2024-12-02 11:21:27,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:27,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763819154] [2024-12-02 11:21:27,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:27,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:28,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:28,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763819154] [2024-12-02 11:21:28,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763819154] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:28,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:28,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 11:21:28,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488308765] [2024-12-02 11:21:28,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:28,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 11:21:28,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:28,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 11:21:28,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:21:28,197 INFO L87 Difference]: Start difference. First operand 1578 states and 2248 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-12-02 11:21:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:28,915 INFO L93 Difference]: Finished difference Result 3087 states and 4390 transitions. [2024-12-02 11:21:28,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 11:21:28,915 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2024-12-02 11:21:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:28,920 INFO L225 Difference]: With dead ends: 3087 [2024-12-02 11:21:28,920 INFO L226 Difference]: Without dead ends: 1717 [2024-12-02 11:21:28,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-12-02 11:21:28,922 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 255 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:28,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 869 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 11:21:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2024-12-02 11:21:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1330. [2024-12-02 11:21:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1219 states have (on average 1.3904840032813781) internal successors, (1695), 1223 states have internal predecessors, (1695), 97 states have call successors, (97), 13 states have call predecessors, (97), 13 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-12-02 11:21:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1889 transitions. [2024-12-02 11:21:29,046 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1889 transitions. Word has length 155 [2024-12-02 11:21:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:29,046 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1889 transitions. [2024-12-02 11:21:29,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-12-02 11:21:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1889 transitions. [2024-12-02 11:21:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:21:29,047 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:29,047 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:29,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-02 11:21:29,047 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:29,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash 311539214, now seen corresponding path program 1 times [2024-12-02 11:21:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:29,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279083569] [2024-12-02 11:21:29,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:29,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:43,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:43,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279083569] [2024-12-02 11:21:43,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279083569] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:43,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:43,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-12-02 11:21:43,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233433571] [2024-12-02 11:21:43,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:43,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 11:21:43,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:43,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 11:21:43,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-12-02 11:21:43,293 INFO L87 Difference]: Start difference. First operand 1330 states and 1889 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:45,556 INFO L93 Difference]: Finished difference Result 2609 states and 3698 transitions. [2024-12-02 11:21:45,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 11:21:45,557 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-12-02 11:21:45,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:45,560 INFO L225 Difference]: With dead ends: 2609 [2024-12-02 11:21:45,560 INFO L226 Difference]: Without dead ends: 1487 [2024-12-02 11:21:45,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2024-12-02 11:21:45,562 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 230 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:45,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 2223 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-12-02 11:21:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2024-12-02 11:21:45,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1330. [2024-12-02 11:21:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1219 states have (on average 1.3896636587366693) internal successors, (1694), 1223 states have internal predecessors, (1694), 97 states have call successors, (97), 13 states have call predecessors, (97), 13 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2024-12-02 11:21:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1888 transitions. [2024-12-02 11:21:45,690 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1888 transitions. Word has length 155 [2024-12-02 11:21:45,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:45,690 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1888 transitions. [2024-12-02 11:21:45,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:45,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1888 transitions. [2024-12-02 11:21:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:21:45,691 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:45,691 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:45,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 11:21:45,692 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:45,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:45,692 INFO L85 PathProgramCache]: Analyzing trace with hash -483650864, now seen corresponding path program 1 times [2024-12-02 11:21:45,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:45,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258222431] [2024-12-02 11:21:45,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:45,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:46,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:46,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258222431] [2024-12-02 11:21:46,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258222431] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:46,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:46,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 11:21:46,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947394593] [2024-12-02 11:21:46,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:46,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 11:21:46,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:46,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 11:21:46,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:21:46,122 INFO L87 Difference]: Start difference. First operand 1330 states and 1888 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:21:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:46,780 INFO L93 Difference]: Finished difference Result 2537 states and 3597 transitions. [2024-12-02 11:21:46,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:21:46,781 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-12-02 11:21:46,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:46,783 INFO L225 Difference]: With dead ends: 2537 [2024-12-02 11:21:46,784 INFO L226 Difference]: Without dead ends: 1415 [2024-12-02 11:21:46,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-12-02 11:21:46,785 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 253 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:46,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 783 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 11:21:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2024-12-02 11:21:46,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1201. [2024-12-02 11:21:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1112 states have (on average 1.3920863309352518) internal successors, (1548), 1114 states have internal predecessors, (1548), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-12-02 11:21:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1702 transitions. [2024-12-02 11:21:46,896 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1702 transitions. Word has length 155 [2024-12-02 11:21:46,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:46,896 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1702 transitions. [2024-12-02 11:21:46,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:21:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1702 transitions. [2024-12-02 11:21:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:21:46,897 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:46,897 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:46,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-02 11:21:46,897 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:46,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:46,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1494768114, now seen corresponding path program 1 times [2024-12-02 11:21:46,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:46,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383088491] [2024-12-02 11:21:46,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:46,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:48,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:48,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383088491] [2024-12-02 11:21:48,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383088491] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:48,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:48,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-12-02 11:21:48,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710526529] [2024-12-02 11:21:48,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:48,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 11:21:48,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:48,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 11:21:48,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-12-02 11:21:48,074 INFO L87 Difference]: Start difference. First operand 1201 states and 1702 transitions. Second operand has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-12-02 11:21:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:49,713 INFO L93 Difference]: Finished difference Result 2340 states and 3312 transitions. [2024-12-02 11:21:49,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 11:21:49,714 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2024-12-02 11:21:49,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:49,717 INFO L225 Difference]: With dead ends: 2340 [2024-12-02 11:21:49,717 INFO L226 Difference]: Without dead ends: 1347 [2024-12-02 11:21:49,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2024-12-02 11:21:49,718 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 446 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:49,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 2468 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 11:21:49,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-12-02 11:21:49,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1195. [2024-12-02 11:21:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1106 states have (on average 1.3942133815551536) internal successors, (1542), 1108 states have internal predecessors, (1542), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-12-02 11:21:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1696 transitions. [2024-12-02 11:21:49,833 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1696 transitions. Word has length 155 [2024-12-02 11:21:49,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:49,833 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1696 transitions. [2024-12-02 11:21:49,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-12-02 11:21:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1696 transitions. [2024-12-02 11:21:49,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-02 11:21:49,834 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:49,835 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:49,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-02 11:21:49,835 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:49,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash 686625358, now seen corresponding path program 1 times [2024-12-02 11:21:49,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:49,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462087661] [2024-12-02 11:21:49,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:49,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:51,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:51,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462087661] [2024-12-02 11:21:51,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462087661] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:51,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:51,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-12-02 11:21:51,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735487574] [2024-12-02 11:21:51,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:51,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-12-02 11:21:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:51,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-12-02 11:21:51,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-12-02 11:21:51,218 INFO L87 Difference]: Start difference. First operand 1195 states and 1696 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:21:52,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:52,965 INFO L93 Difference]: Finished difference Result 2325 states and 3297 transitions. [2024-12-02 11:21:52,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 11:21:52,965 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-12-02 11:21:52,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:52,968 INFO L225 Difference]: With dead ends: 2325 [2024-12-02 11:21:52,968 INFO L226 Difference]: Without dead ends: 1338 [2024-12-02 11:21:52,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2024-12-02 11:21:52,969 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 346 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:52,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 2245 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-12-02 11:21:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2024-12-02 11:21:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1190. [2024-12-02 11:21:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1101 states have (on average 1.3960036330608538) internal successors, (1537), 1103 states have internal predecessors, (1537), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-12-02 11:21:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1691 transitions. [2024-12-02 11:21:53,086 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1691 transitions. Word has length 155 [2024-12-02 11:21:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:53,086 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1691 transitions. [2024-12-02 11:21:53,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:21:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1691 transitions. [2024-12-02 11:21:53,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-02 11:21:53,087 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:53,087 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:53,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-02 11:21:53,087 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:53,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:53,088 INFO L85 PathProgramCache]: Analyzing trace with hash -612042519, now seen corresponding path program 1 times [2024-12-02 11:21:53,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:53,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096835423] [2024-12-02 11:21:53,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:53,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:53,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:53,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096835423] [2024-12-02 11:21:53,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096835423] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:53,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:53,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:21:53,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066676237] [2024-12-02 11:21:53,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:53,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:21:53,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:53,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:21:53,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:21:53,148 INFO L87 Difference]: Start difference. First operand 1190 states and 1691 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:53,282 INFO L93 Difference]: Finished difference Result 2185 states and 3110 transitions. [2024-12-02 11:21:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:21:53,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-12-02 11:21:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:53,285 INFO L225 Difference]: With dead ends: 2185 [2024-12-02 11:21:53,285 INFO L226 Difference]: Without dead ends: 1198 [2024-12-02 11:21:53,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:21:53,286 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 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-12-02 11:21:53,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:21:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-12-02 11:21:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2024-12-02 11:21:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1109 states have (on average 1.393146979260595) internal successors, (1545), 1111 states have internal predecessors, (1545), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-12-02 11:21:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1699 transitions. [2024-12-02 11:21:53,433 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1699 transitions. Word has length 156 [2024-12-02 11:21:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:53,434 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1699 transitions. [2024-12-02 11:21:53,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1699 transitions. [2024-12-02 11:21:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-02 11:21:53,435 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:53,435 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:53,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-02 11:21:53,435 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:53,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash -353877081, now seen corresponding path program 1 times [2024-12-02 11:21:53,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:53,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690469116] [2024-12-02 11:21:53,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:53,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-12-02 11:21:53,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:53,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690469116] [2024-12-02 11:21:53,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690469116] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:21:53,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573072336] [2024-12-02 11:21:53,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:53,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:21:53,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:21:53,577 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:21:53,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 11:21:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:53,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 11:21:53,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:21:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:53,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:21:53,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573072336] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:53,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:21:53,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-12-02 11:21:53,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640089245] [2024-12-02 11:21:53,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:53,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:21:53,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:53,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:21:53,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:21:53,855 INFO L87 Difference]: Start difference. First operand 1198 states and 1699 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:53,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:53,982 INFO L93 Difference]: Finished difference Result 2219 states and 3143 transitions. [2024-12-02 11:21:53,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:21:53,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-12-02 11:21:53,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:53,985 INFO L225 Difference]: With dead ends: 2219 [2024-12-02 11:21:53,986 INFO L226 Difference]: Without dead ends: 1230 [2024-12-02 11:21:53,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:21:53,987 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:53,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 859 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:21:53,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2024-12-02 11:21:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1206. [2024-12-02 11:21:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1117 states have (on average 1.3903312444046554) internal successors, (1553), 1119 states have internal predecessors, (1553), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-12-02 11:21:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1707 transitions. [2024-12-02 11:21:54,131 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1707 transitions. Word has length 156 [2024-12-02 11:21:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:54,131 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1707 transitions. [2024-12-02 11:21:54,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1707 transitions. [2024-12-02 11:21:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-02 11:21:54,132 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:54,133 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:54,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-12-02 11:21:54,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-12-02 11:21:54,333 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:54,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1927855748, now seen corresponding path program 1 times [2024-12-02 11:21:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:54,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284929380] [2024-12-02 11:21:54,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:54,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:54,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:54,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284929380] [2024-12-02 11:21:54,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284929380] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:54,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:54,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:21:54,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262696677] [2024-12-02 11:21:54,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:54,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:21:54,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:54,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:21:54,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:21:54,478 INFO L87 Difference]: Start difference. First operand 1206 states and 1707 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:54,707 INFO L93 Difference]: Finished difference Result 2615 states and 3609 transitions. [2024-12-02 11:21:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:21:54,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-12-02 11:21:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:54,712 INFO L225 Difference]: With dead ends: 2615 [2024-12-02 11:21:54,712 INFO L226 Difference]: Without dead ends: 1611 [2024-12-02 11:21:54,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-02 11:21:54,714 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 53 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:54,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 631 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:21:54,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2024-12-02 11:21:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1471. [2024-12-02 11:21:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1382 states have (on average 1.329232995658466) internal successors, (1837), 1384 states have internal predecessors, (1837), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-12-02 11:21:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 1991 transitions. [2024-12-02 11:21:54,948 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 1991 transitions. Word has length 158 [2024-12-02 11:21:54,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:54,948 INFO L471 AbstractCegarLoop]: Abstraction has 1471 states and 1991 transitions. [2024-12-02 11:21:54,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:54,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1991 transitions. [2024-12-02 11:21:54,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-02 11:21:54,950 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:54,950 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:54,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-12-02 11:21:54,950 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:54,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:54,951 INFO L85 PathProgramCache]: Analyzing trace with hash -743455959, now seen corresponding path program 1 times [2024-12-02 11:21:54,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:54,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457819273] [2024-12-02 11:21:54,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:54,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:55,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:55,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457819273] [2024-12-02 11:21:55,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457819273] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:55,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:55,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:21:55,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249861283] [2024-12-02 11:21:55,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:55,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:21:55,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:55,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:21:55,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:21:55,009 INFO L87 Difference]: Start difference. First operand 1471 states and 1991 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:55,138 INFO L93 Difference]: Finished difference Result 2698 states and 3655 transitions. [2024-12-02 11:21:55,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:21:55,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-12-02 11:21:55,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:55,143 INFO L225 Difference]: With dead ends: 2698 [2024-12-02 11:21:55,143 INFO L226 Difference]: Without dead ends: 1475 [2024-12-02 11:21:55,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:21:55,145 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 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-12-02 11:21:55,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:21:55,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2024-12-02 11:21:55,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1475. [2024-12-02 11:21:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1386 states have (on average 1.3282828282828283) internal successors, (1841), 1388 states have internal predecessors, (1841), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-12-02 11:21:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1995 transitions. [2024-12-02 11:21:55,272 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1995 transitions. Word has length 158 [2024-12-02 11:21:55,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:55,273 INFO L471 AbstractCegarLoop]: Abstraction has 1475 states and 1995 transitions. [2024-12-02 11:21:55,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:55,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1995 transitions. [2024-12-02 11:21:55,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-02 11:21:55,274 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:55,274 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:55,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-12-02 11:21:55,274 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:55,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:55,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1031551403, now seen corresponding path program 1 times [2024-12-02 11:21:55,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:55,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301074159] [2024-12-02 11:21:55,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:55,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:55,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:55,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301074159] [2024-12-02 11:21:55,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301074159] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:55,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:55,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 11:21:55,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656374086] [2024-12-02 11:21:55,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:55,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 11:21:55,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:55,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 11:21:55,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:21:55,717 INFO L87 Difference]: Start difference. First operand 1475 states and 1995 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:56,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:21:56,051 INFO L93 Difference]: Finished difference Result 2374 states and 3133 transitions. [2024-12-02 11:21:56,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:21:56,051 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-12-02 11:21:56,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:21:56,056 INFO L225 Difference]: With dead ends: 2374 [2024-12-02 11:21:56,056 INFO L226 Difference]: Without dead ends: 2372 [2024-12-02 11:21:56,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-12-02 11:21:56,058 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 259 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:21:56,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 953 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:21:56,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2024-12-02 11:21:56,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2314. [2024-12-02 11:21:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 2225 states have (on average 1.303820224719101) internal successors, (2901), 2227 states have internal predecessors, (2901), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-12-02 11:21:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3055 transitions. [2024-12-02 11:21:56,291 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3055 transitions. Word has length 158 [2024-12-02 11:21:56,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:21:56,291 INFO L471 AbstractCegarLoop]: Abstraction has 2314 states and 3055 transitions. [2024-12-02 11:21:56,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:21:56,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3055 transitions. [2024-12-02 11:21:56,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-12-02 11:21:56,293 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:21:56,293 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:21:56,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-12-02 11:21:56,293 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:21:56,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:21:56,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1807863380, now seen corresponding path program 1 times [2024-12-02 11:21:56,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:21:56,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123462937] [2024-12-02 11:21:56,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:21:56,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:21:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:21:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:21:58,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:21:58,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123462937] [2024-12-02 11:21:58,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123462937] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:21:58,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:21:58,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-12-02 11:21:58,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771011547] [2024-12-02 11:21:58,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:21:58,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 11:21:58,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:21:58,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 11:21:58,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-12-02 11:21:58,089 INFO L87 Difference]: Start difference. First operand 2314 states and 3055 transitions. Second operand has 17 states, 16 states have (on average 4.1875) internal successors, (67), 17 states have internal predecessors, (67), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-12-02 11:22:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:01,625 INFO L93 Difference]: Finished difference Result 4622 states and 6098 transitions. [2024-12-02 11:22:01,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 11:22:01,626 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.1875) internal successors, (67), 17 states have internal predecessors, (67), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 159 [2024-12-02 11:22:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:01,629 INFO L225 Difference]: With dead ends: 4622 [2024-12-02 11:22:01,629 INFO L226 Difference]: Without dead ends: 2674 [2024-12-02 11:22:01,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2024-12-02 11:22:01,631 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 344 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:01,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1992 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-12-02 11:22:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2024-12-02 11:22:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2581. [2024-12-02 11:22:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2581 states, 2451 states have (on average 1.2966136270909834) internal successors, (3178), 2456 states have internal predecessors, (3178), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-12-02 11:22:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 3402 transitions. [2024-12-02 11:22:01,861 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 3402 transitions. Word has length 159 [2024-12-02 11:22:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:01,861 INFO L471 AbstractCegarLoop]: Abstraction has 2581 states and 3402 transitions. [2024-12-02 11:22:01,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.1875) internal successors, (67), 17 states have internal predecessors, (67), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-12-02 11:22:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 3402 transitions. [2024-12-02 11:22:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-12-02 11:22:01,863 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:01,863 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:01,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-02 11:22:01,863 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:01,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:01,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1535555884, now seen corresponding path program 1 times [2024-12-02 11:22:01,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:22:01,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218232316] [2024-12-02 11:22:01,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:01,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:22:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:02,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:22:02,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218232316] [2024-12-02 11:22:02,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218232316] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:22:02,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:22:02,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 11:22:02,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109104187] [2024-12-02 11:22:02,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:02,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 11:22:02,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:22:02,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 11:22:02,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:22:02,263 INFO L87 Difference]: Start difference. First operand 2581 states and 3402 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:02,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:02,946 INFO L93 Difference]: Finished difference Result 4958 states and 6540 transitions. [2024-12-02 11:22:02,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 11:22:02,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 159 [2024-12-02 11:22:02,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:02,951 INFO L225 Difference]: With dead ends: 4958 [2024-12-02 11:22:02,951 INFO L226 Difference]: Without dead ends: 2710 [2024-12-02 11:22:02,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:22:02,954 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 215 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:02,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 970 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 11:22:02,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2024-12-02 11:22:03,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2430. [2024-12-02 11:22:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 2300 states have (on average 1.2969565217391303) internal successors, (2983), 2305 states have internal predecessors, (2983), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-12-02 11:22:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 3207 transitions. [2024-12-02 11:22:03,204 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 3207 transitions. Word has length 159 [2024-12-02 11:22:03,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:03,204 INFO L471 AbstractCegarLoop]: Abstraction has 2430 states and 3207 transitions. [2024-12-02 11:22:03,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 3207 transitions. [2024-12-02 11:22:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-02 11:22:03,206 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:03,206 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:03,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-12-02 11:22:03,206 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:03,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:03,206 INFO L85 PathProgramCache]: Analyzing trace with hash 603257263, now seen corresponding path program 1 times [2024-12-02 11:22:03,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:22:03,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696192269] [2024-12-02 11:22:03,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:03,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:22:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:03,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:22:03,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696192269] [2024-12-02 11:22:03,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696192269] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:22:03,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:22:03,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 11:22:03,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684370491] [2024-12-02 11:22:03,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:03,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 11:22:03,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:22:03,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 11:22:03,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:22:03,824 INFO L87 Difference]: Start difference. First operand 2430 states and 3207 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-12-02 11:22:04,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:04,347 INFO L93 Difference]: Finished difference Result 6450 states and 8473 transitions. [2024-12-02 11:22:04,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:22:04,348 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 160 [2024-12-02 11:22:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:04,352 INFO L225 Difference]: With dead ends: 6450 [2024-12-02 11:22:04,352 INFO L226 Difference]: Without dead ends: 4264 [2024-12-02 11:22:04,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-12-02 11:22:04,355 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 426 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:04,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 816 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:22:04,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4264 states. [2024-12-02 11:22:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4264 to 3359. [2024-12-02 11:22:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3359 states, 3229 states have (on average 1.3041189222669558) internal successors, (4211), 3234 states have internal predecessors, (4211), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-12-02 11:22:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 4435 transitions. [2024-12-02 11:22:04,594 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 4435 transitions. Word has length 160 [2024-12-02 11:22:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:04,595 INFO L471 AbstractCegarLoop]: Abstraction has 3359 states and 4435 transitions. [2024-12-02 11:22:04,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-12-02 11:22:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 4435 transitions. [2024-12-02 11:22:04,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-02 11:22:04,596 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:04,596 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:04,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-12-02 11:22:04,597 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:04,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:04,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1989460657, now seen corresponding path program 1 times [2024-12-02 11:22:04,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:22:04,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549359886] [2024-12-02 11:22:04,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:04,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:22:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:04,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:22:04,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549359886] [2024-12-02 11:22:04,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549359886] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:22:04,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:22:04,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 11:22:04,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568280279] [2024-12-02 11:22:04,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:04,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 11:22:04,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:22:04,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 11:22:04,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:22:04,911 INFO L87 Difference]: Start difference. First operand 3359 states and 4435 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:05,410 INFO L93 Difference]: Finished difference Result 7302 states and 9596 transitions. [2024-12-02 11:22:05,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 11:22:05,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-12-02 11:22:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:05,414 INFO L225 Difference]: With dead ends: 7302 [2024-12-02 11:22:05,414 INFO L226 Difference]: Without dead ends: 4271 [2024-12-02 11:22:05,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:22:05,417 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 201 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:05,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 790 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:22:05,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2024-12-02 11:22:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3352. [2024-12-02 11:22:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 3222 states have (on average 1.3026070763500932) internal successors, (4197), 3227 states have internal predecessors, (4197), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-12-02 11:22:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 4421 transitions. [2024-12-02 11:22:05,648 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 4421 transitions. Word has length 160 [2024-12-02 11:22:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:05,648 INFO L471 AbstractCegarLoop]: Abstraction has 3352 states and 4421 transitions. [2024-12-02 11:22:05,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 4421 transitions. [2024-12-02 11:22:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-02 11:22:05,650 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:05,650 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:05,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-12-02 11:22:05,650 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:05,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:05,651 INFO L85 PathProgramCache]: Analyzing trace with hash 459533258, now seen corresponding path program 1 times [2024-12-02 11:22:05,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:22:05,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857764106] [2024-12-02 11:22:05,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:05,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:22:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:05,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:22:05,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857764106] [2024-12-02 11:22:05,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857764106] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:22:05,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:22:05,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:22:05,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307368623] [2024-12-02 11:22:05,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:05,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:22:05,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:22:05,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:22:05,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:22:05,707 INFO L87 Difference]: Start difference. First operand 3352 states and 4421 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:05,938 INFO L93 Difference]: Finished difference Result 6541 states and 8667 transitions. [2024-12-02 11:22:05,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:22:05,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-12-02 11:22:05,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:05,942 INFO L225 Difference]: With dead ends: 6541 [2024-12-02 11:22:05,943 INFO L226 Difference]: Without dead ends: 3445 [2024-12-02 11:22:05,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:22:05,945 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 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-12-02 11:22:05,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:22:05,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2024-12-02 11:22:06,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3445. [2024-12-02 11:22:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 3315 states have (on average 1.2941176470588236) internal successors, (4290), 3320 states have internal predecessors, (4290), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-12-02 11:22:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 4514 transitions. [2024-12-02 11:22:06,215 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 4514 transitions. Word has length 160 [2024-12-02 11:22:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:06,215 INFO L471 AbstractCegarLoop]: Abstraction has 3445 states and 4514 transitions. [2024-12-02 11:22:06,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 4514 transitions. [2024-12-02 11:22:06,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-02 11:22:06,217 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:06,217 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:06,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-12-02 11:22:06,217 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:06,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:06,218 INFO L85 PathProgramCache]: Analyzing trace with hash 600081868, now seen corresponding path program 1 times [2024-12-02 11:22:06,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:22:06,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603841677] [2024-12-02 11:22:06,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:06,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:22:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:06,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:22:06,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603841677] [2024-12-02 11:22:06,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603841677] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:22:06,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:22:06,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:22:06,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568062292] [2024-12-02 11:22:06,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:06,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:22:06,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:22:06,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:22:06,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:22:06,374 INFO L87 Difference]: Start difference. First operand 3445 states and 4514 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:06,597 INFO L93 Difference]: Finished difference Result 6553 states and 8517 transitions. [2024-12-02 11:22:06,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:22:06,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2024-12-02 11:22:06,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:06,602 INFO L225 Difference]: With dead ends: 6553 [2024-12-02 11:22:06,602 INFO L226 Difference]: Without dead ends: 3352 [2024-12-02 11:22:06,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:22:06,606 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:06,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 517 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:22:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2024-12-02 11:22:06,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 3352. [2024-12-02 11:22:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 3222 states have (on average 1.24487895716946) internal successors, (4011), 3227 states have internal predecessors, (4011), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-12-02 11:22:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 4235 transitions. [2024-12-02 11:22:06,959 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 4235 transitions. Word has length 160 [2024-12-02 11:22:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:06,959 INFO L471 AbstractCegarLoop]: Abstraction has 3352 states and 4235 transitions. [2024-12-02 11:22:06,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 4235 transitions. [2024-12-02 11:22:06,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-12-02 11:22:06,962 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:06,962 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:06,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-12-02 11:22:06,962 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:06,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:06,962 INFO L85 PathProgramCache]: Analyzing trace with hash -795053308, now seen corresponding path program 1 times [2024-12-02 11:22:06,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:22:06,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136657197] [2024-12-02 11:22:06,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:06,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:22:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:07,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:22:07,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136657197] [2024-12-02 11:22:07,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136657197] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:22:07,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:22:07,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 11:22:07,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658046602] [2024-12-02 11:22:07,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:07,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 11:22:07,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:22:07,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 11:22:07,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:22:07,558 INFO L87 Difference]: Start difference. First operand 3352 states and 4235 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-12-02 11:22:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:08,080 INFO L93 Difference]: Finished difference Result 6476 states and 8188 transitions. [2024-12-02 11:22:08,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 11:22:08,080 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 161 [2024-12-02 11:22:08,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:08,083 INFO L225 Difference]: With dead ends: 6476 [2024-12-02 11:22:08,084 INFO L226 Difference]: Without dead ends: 3452 [2024-12-02 11:22:08,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-12-02 11:22:08,086 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 406 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:08,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 755 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:22:08,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2024-12-02 11:22:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3352. [2024-12-02 11:22:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 3222 states have (on average 1.2405338299193047) internal successors, (3997), 3227 states have internal predecessors, (3997), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-12-02 11:22:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 4221 transitions. [2024-12-02 11:22:08,317 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 4221 transitions. Word has length 161 [2024-12-02 11:22:08,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:08,317 INFO L471 AbstractCegarLoop]: Abstraction has 3352 states and 4221 transitions. [2024-12-02 11:22:08,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-12-02 11:22:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 4221 transitions. [2024-12-02 11:22:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-12-02 11:22:08,319 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:08,319 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:08,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-12-02 11:22:08,319 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:08,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:08,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1188080318, now seen corresponding path program 1 times [2024-12-02 11:22:08,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:22:08,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797216582] [2024-12-02 11:22:08,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:08,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:22:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:08,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:22:08,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797216582] [2024-12-02 11:22:08,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797216582] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:22:08,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:22:08,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:22:08,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993200486] [2024-12-02 11:22:08,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:08,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:22:08,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:22:08,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:22:08,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:22:08,608 INFO L87 Difference]: Start difference. First operand 3352 states and 4221 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:09,020 INFO L93 Difference]: Finished difference Result 6420 states and 8083 transitions. [2024-12-02 11:22:09,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:22:09,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-12-02 11:22:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:09,024 INFO L225 Difference]: With dead ends: 6420 [2024-12-02 11:22:09,024 INFO L226 Difference]: Without dead ends: 3396 [2024-12-02 11:22:09,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:22:09,026 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 287 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:09,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 538 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:22:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2024-12-02 11:22:09,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3352. [2024-12-02 11:22:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 3222 states have (on average 1.2383612662942272) internal successors, (3990), 3227 states have internal predecessors, (3990), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-12-02 11:22:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 4214 transitions. [2024-12-02 11:22:09,267 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 4214 transitions. Word has length 161 [2024-12-02 11:22:09,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:09,268 INFO L471 AbstractCegarLoop]: Abstraction has 3352 states and 4214 transitions. [2024-12-02 11:22:09,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 4214 transitions. [2024-12-02 11:22:09,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-12-02 11:22:09,269 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:09,269 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:09,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-12-02 11:22:09,269 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:09,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:09,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1266035031, now seen corresponding path program 1 times [2024-12-02 11:22:09,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:22:09,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173747530] [2024-12-02 11:22:09,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:09,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:22:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:09,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:22:09,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173747530] [2024-12-02 11:22:09,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173747530] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:22:09,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:22:09,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 11:22:09,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251441204] [2024-12-02 11:22:09,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:09,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 11:22:09,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:22:09,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 11:22:09,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:22:09,517 INFO L87 Difference]: Start difference. First operand 3352 states and 4214 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:22:10,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:10,104 INFO L93 Difference]: Finished difference Result 5437 states and 6826 transitions. [2024-12-02 11:22:10,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:22:10,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 161 [2024-12-02 11:22:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:10,110 INFO L225 Difference]: With dead ends: 5437 [2024-12-02 11:22:10,110 INFO L226 Difference]: Without dead ends: 3426 [2024-12-02 11:22:10,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:22:10,112 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 319 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:10,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 514 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:22:10,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2024-12-02 11:22:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3352. [2024-12-02 11:22:10,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 3222 states have (on average 1.2262569832402235) internal successors, (3951), 3227 states have internal predecessors, (3951), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-12-02 11:22:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 4175 transitions. [2024-12-02 11:22:10,372 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 4175 transitions. Word has length 161 [2024-12-02 11:22:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:10,372 INFO L471 AbstractCegarLoop]: Abstraction has 3352 states and 4175 transitions. [2024-12-02 11:22:10,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:22:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 4175 transitions. [2024-12-02 11:22:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-12-02 11:22:10,374 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:10,374 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:10,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-12-02 11:22:10,374 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:10,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:10,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1400048537, now seen corresponding path program 1 times [2024-12-02 11:22:10,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:22:10,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277089629] [2024-12-02 11:22:10,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:10,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:22:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:10,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:22:10,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277089629] [2024-12-02 11:22:10,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277089629] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:22:10,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:22:10,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:22:10,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152359866] [2024-12-02 11:22:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:10,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:22:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:22:10,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:22:10,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:22:10,545 INFO L87 Difference]: Start difference. First operand 3352 states and 4175 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:11,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:11,200 INFO L93 Difference]: Finished difference Result 7349 states and 9110 transitions. [2024-12-02 11:22:11,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:22:11,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-12-02 11:22:11,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:11,204 INFO L225 Difference]: With dead ends: 7349 [2024-12-02 11:22:11,204 INFO L226 Difference]: Without dead ends: 4325 [2024-12-02 11:22:11,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:22:11,207 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 116 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:11,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 822 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:22:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4325 states. [2024-12-02 11:22:11,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4325 to 3826. [2024-12-02 11:22:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3826 states, 3696 states have (on average 1.2126623376623376) internal successors, (4482), 3701 states have internal predecessors, (4482), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-12-02 11:22:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 4706 transitions. [2024-12-02 11:22:11,453 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 4706 transitions. Word has length 161 [2024-12-02 11:22:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:11,453 INFO L471 AbstractCegarLoop]: Abstraction has 3826 states and 4706 transitions. [2024-12-02 11:22:11,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 4706 transitions. [2024-12-02 11:22:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-12-02 11:22:11,455 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:11,455 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:11,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-12-02 11:22:11,455 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:11,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1141883099, now seen corresponding path program 1 times [2024-12-02 11:22:11,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:22:11,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097446049] [2024-12-02 11:22:11,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:11,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:22:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-12-02 11:22:11,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:22:11,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097446049] [2024-12-02 11:22:11,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097446049] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:22:11,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332464013] [2024-12-02 11:22:11,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:11,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:22:11,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:22:11,605 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:22:11,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 11:22:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:11,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 11:22:11,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:22:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:11,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:22:11,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332464013] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:22:11,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:22:11,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2024-12-02 11:22:11,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764843260] [2024-12-02 11:22:11,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:11,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 11:22:11,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:22:11,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 11:22:11,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-12-02 11:22:11,927 INFO L87 Difference]: Start difference. First operand 3826 states and 4706 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:12,207 INFO L93 Difference]: Finished difference Result 7381 states and 9090 transitions. [2024-12-02 11:22:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 11:22:12,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2024-12-02 11:22:12,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:12,211 INFO L225 Difference]: With dead ends: 7381 [2024-12-02 11:22:12,211 INFO L226 Difference]: Without dead ends: 3919 [2024-12-02 11:22:12,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-12-02 11:22:12,214 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:12,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1013 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:22:12,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-12-02 11:22:12,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3823. [2024-12-02 11:22:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3823 states, 3693 states have (on average 1.2128350934199839) internal successors, (4479), 3698 states have internal predecessors, (4479), 112 states have call successors, (112), 17 states have call predecessors, (112), 17 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2024-12-02 11:22:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3823 states to 3823 states and 4703 transitions. [2024-12-02 11:22:12,474 INFO L78 Accepts]: Start accepts. Automaton has 3823 states and 4703 transitions. Word has length 161 [2024-12-02 11:22:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:12,474 INFO L471 AbstractCegarLoop]: Abstraction has 3823 states and 4703 transitions. [2024-12-02 11:22:12,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3823 states and 4703 transitions. [2024-12-02 11:22:12,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-12-02 11:22:12,476 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:12,476 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:12,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 11:22:12,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:22:12,676 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:12,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:12,677 INFO L85 PathProgramCache]: Analyzing trace with hash -991275417, now seen corresponding path program 1 times [2024-12-02 11:22:12,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:22:12,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448573055] [2024-12-02 11:22:12,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:12,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:22:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-12-02 11:22:13,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:22:13,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448573055] [2024-12-02 11:22:13,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448573055] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:22:13,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671204308] [2024-12-02 11:22:13,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:13,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:22:13,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:22:13,225 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:22:13,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 11:22:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:13,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-12-02 11:22:13,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:22:13,744 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-12-02 11:22:13,903 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-12-02 11:22:14,417 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-12-02 11:22:14,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2024-12-02 11:22:14,438 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-12-02 11:22:14,438 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 28 treesize of output 12 [2024-12-02 11:22:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 312 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-12-02 11:22:14,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:22:14,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671204308] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:22:14,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 11:22:14,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2024-12-02 11:22:14,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086615945] [2024-12-02 11:22:14,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 11:22:14,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-12-02 11:22:14,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:22:14,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-12-02 11:22:14,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-12-02 11:22:14,716 INFO L87 Difference]: Start difference. First operand 3823 states and 4703 transitions. Second operand has 19 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2024-12-02 11:22:15,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:15,743 INFO L93 Difference]: Finished difference Result 7942 states and 9737 transitions. [2024-12-02 11:22:15,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 11:22:15,744 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) Word has length 161 [2024-12-02 11:22:15,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:15,748 INFO L225 Difference]: With dead ends: 7942 [2024-12-02 11:22:15,748 INFO L226 Difference]: Without dead ends: 4339 [2024-12-02 11:22:15,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 274 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-12-02 11:22:15,751 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 660 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:15,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1531 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 11:22:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4339 states. [2024-12-02 11:22:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4339 to 4288. [2024-12-02 11:22:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4288 states, 4122 states have (on average 1.1887433284813198) internal successors, (4900), 4134 states have internal predecessors, (4900), 140 states have call successors, (140), 25 states have call predecessors, (140), 25 states have return successors, (140), 128 states have call predecessors, (140), 140 states have call successors, (140) [2024-12-02 11:22:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 5180 transitions. [2024-12-02 11:22:16,129 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 5180 transitions. Word has length 161 [2024-12-02 11:22:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:16,129 INFO L471 AbstractCegarLoop]: Abstraction has 4288 states and 5180 transitions. [2024-12-02 11:22:16,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2024-12-02 11:22:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 5180 transitions. [2024-12-02 11:22:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-12-02 11:22:16,132 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:16,133 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:16,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 11:22:16,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:22:16,333 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:16,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:16,333 INFO L85 PathProgramCache]: Analyzing trace with hash 242058368, now seen corresponding path program 1 times [2024-12-02 11:22:16,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:22:16,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814232198] [2024-12-02 11:22:16,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:16,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:22:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:17,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:22:17,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814232198] [2024-12-02 11:22:17,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814232198] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:22:17,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:22:17,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-12-02 11:22:17,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061556530] [2024-12-02 11:22:17,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:17,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 11:22:17,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:22:17,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 11:22:17,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-12-02 11:22:17,162 INFO L87 Difference]: Start difference. First operand 4288 states and 5180 transitions. Second operand has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-12-02 11:22:18,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:18,220 INFO L93 Difference]: Finished difference Result 4679 states and 5646 transitions. [2024-12-02 11:22:18,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 11:22:18,220 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 163 [2024-12-02 11:22:18,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:18,227 INFO L225 Difference]: With dead ends: 4679 [2024-12-02 11:22:18,227 INFO L226 Difference]: Without dead ends: 4677 [2024-12-02 11:22:18,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2024-12-02 11:22:18,229 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 329 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:18,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1550 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 11:22:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4677 states. [2024-12-02 11:22:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4677 to 4666. [2024-12-02 11:22:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4666 states, 4479 states have (on average 1.1879883902656843) internal successors, (5321), 4498 states have internal predecessors, (5321), 154 states have call successors, (154), 32 states have call predecessors, (154), 32 states have return successors, (154), 135 states have call predecessors, (154), 154 states have call successors, (154) [2024-12-02 11:22:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 5629 transitions. [2024-12-02 11:22:18,705 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 5629 transitions. Word has length 163 [2024-12-02 11:22:18,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:18,705 INFO L471 AbstractCegarLoop]: Abstraction has 4666 states and 5629 transitions. [2024-12-02 11:22:18,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-12-02 11:22:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 5629 transitions. [2024-12-02 11:22:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-12-02 11:22:18,707 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:18,707 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:18,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-12-02 11:22:18,707 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:18,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:18,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1822060643, now seen corresponding path program 1 times [2024-12-02 11:22:18,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:22:18,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665287449] [2024-12-02 11:22:18,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:18,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:22:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:22:18,761 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 11:22:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:22:18,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 11:22:18,899 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 11:22:18,900 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 11:22:18,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-12-02 11:22:18,905 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:22:19,031 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 11:22:19,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:22:19 BoogieIcfgContainer [2024-12-02 11:22:19,033 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 11:22:19,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 11:22:19,034 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 11:22:19,034 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 11:22:19,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:19:30" (3/4) ... [2024-12-02 11:22:19,037 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 11:22:19,037 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 11:22:19,038 INFO L158 Benchmark]: Toolchain (without parser) took 169802.96ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 118.7MB in the beginning and 696.5MB in the end (delta: -577.7MB). Peak memory consumption was 486.5MB. Max. memory is 16.1GB. [2024-12-02 11:22:19,038 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:22:19,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.50ms. Allocated memory is still 142.6MB. Free memory was 118.6MB in the beginning and 102.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 11:22:19,038 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.98ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 98.1MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:22:19,039 INFO L158 Benchmark]: Boogie Preprocessor took 73.81ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 93.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 11:22:19,039 INFO L158 Benchmark]: RCFGBuilder took 782.36ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 102.6MB in the end (delta: -9.4MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2024-12-02 11:22:19,039 INFO L158 Benchmark]: TraceAbstraction took 168551.52ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 102.1MB in the beginning and 696.6MB in the end (delta: -594.6MB). Peak memory consumption was 471.3MB. Max. memory is 16.1GB. [2024-12-02 11:22:19,039 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 1.2GB. Free memory was 696.6MB in the beginning and 696.5MB in the end (delta: 106.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:22:19,040 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.30ms. Allocated memory is still 142.6MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.50ms. Allocated memory is still 142.6MB. Free memory was 118.6MB in the beginning and 102.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.98ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 98.1MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.81ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 93.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 782.36ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 102.6MB in the end (delta: -9.4MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 168551.52ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 102.1MB in the beginning and 696.6MB in the end (delta: -594.6MB). Peak memory consumption was 471.3MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 1.2GB. Free memory was 696.6MB in the beginning and 696.5MB in the end (delta: 106.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer = &(BOOL_unsigned_char_Array_0[2]); [L28] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer = &(BOOL_unsigned_char_Array_0[3]); [L29] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer = &(BOOL_unsigned_char_Array_0[4]); [L30-L32] double double_Array_0[2] = { 10.5, 99.25 }; [L30-L32] double double_Array_0[2] = { 10.5, 99.25 }; [L30-L32] double double_Array_0[2] = { 10.5, 99.25 }; [L33] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L34] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L35-L37] signed char signed_char_Array_0[1] = { 0 }; [L35-L37] signed char signed_char_Array_0[1] = { 0 }; [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L42] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0][0]); [L43] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1][0]); [L44] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[0][1]); [L45] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer = &(unsigned_char_Array_0[1][1]); [L46] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer = &(unsigned_char_Array_0[0][2]); [L47] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer = &(unsigned_char_Array_0[1][2]); [L48] unsigned char last_1_unsigned_char_Array_0_0__1_ = 64; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=0, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L122] isInitial = 1 [L123] FCALL initially() [L125] CALL updateLastVariables() [L115] EXPR unsigned_char_Array_0[0][1] [L115] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L125] RET updateLastVariables() [L126] CALL updateVariables() [L84] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L85] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L85] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L85] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L86] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L86] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L86] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L87] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L88] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L88] CALL assume_abort_if_not(BOOL_unsigned_char_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L88] RET assume_abort_if_not(BOOL_unsigned_char_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L89] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L89] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L89] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L90] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L91] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L91] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L91] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L92] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L92] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L92] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L93] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L94] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L94] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L94] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L95] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L95] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L95] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L96] double_Array_0[1] = __VERIFIER_nondet_double() [L97] EXPR double_Array_0[1] [L97] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L97] EXPR double_Array_0[1] [L97] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L98] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L99] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L99] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L99] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L100] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L100] CALL assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L100] RET assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L101] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L102] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L102] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L102] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L103] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L103] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L103] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L104] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L105] EXPR unsigned_char_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L105] CALL assume_abort_if_not(unsigned_char_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L105] RET assume_abort_if_not(unsigned_char_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L106] EXPR unsigned_char_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L106] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L106] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L107] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L108] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L108] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L108] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L109] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L109] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L109] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L110] unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L111] EXPR unsigned_char_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L111] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L111] RET assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L112] EXPR unsigned_char_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L112] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L112] RET assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L126] RET updateVariables() [L127] CALL step() [L52] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L52] EXPR last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L52] COND TRUE (last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_ [L53] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L53] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L53] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L53] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) [L53] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L53] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L53] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) = (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L57] COND FALSE !(((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L60] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L60] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L60] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L60] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L61] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L61] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L61] COND FALSE !((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) [L68] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer) [L68] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) [L73] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L73] unsigned char stepLocal_1 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)); [L74] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L74] unsigned char stepLocal_0 = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)); [L75] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L75] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) [L76] stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, stepLocal_1=64, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L76] stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L76] COND TRUE stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) [L77] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L77] COND TRUE stepLocal_1 > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) [L78] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L78] (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer) [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L118] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L118] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1) [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1 [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1 [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1 [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L118] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1)) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) 1))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1)) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) 1))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118-L119] return (((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1)) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) 1))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 168.4s, OverallIterations: 56, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 78.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15888 SdHoareTripleChecker+Valid, 28.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15863 mSDsluCounter, 61072 SdHoareTripleChecker+Invalid, 24.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50133 mSDsCounter, 1917 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29506 IncrementalHoareTripleChecker+Invalid, 31423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1917 mSolverCounterUnsat, 10939 mSDtfsCounter, 29506 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1791 GetRequests, 1097 SyntacticMatches, 6 SemanticMatches, 688 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2534 ImplicationChecksByTransitivity, 53.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4666occurred in iteration=55, InterpolantAutomatonStates: 486, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.3s AutomataMinimizationTime, 55 MinimizatonAttempts, 9800 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 77.1s InterpolantComputationTime, 9505 NumberOfCodeBlocks, 9505 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 9282 ConstructedInterpolants, 0 QuantifiedInterpolants, 76836 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2879 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 60 InterpolantComputations, 54 PerfectInterpolantSequences, 40491/41040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-12-02 11:22:19,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1 --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 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 11:22:21,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 11:22:21,215 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-12-02 11:22:21,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 11:22:21,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 11:22:21,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 11:22:21,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 11:22:21,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 11:22:21,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 11:22:21,244 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 11:22:21,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 11:22:21,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 11:22:21,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 11:22:21,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 11:22:21,245 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 11:22:21,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 11:22:21,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 11:22:21,245 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 11:22:21,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 11:22:21,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 11:22:21,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 11:22:21,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 11:22:21,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 11:22:21,246 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 11:22:21,246 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 11:22:21,246 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 11:22:21,246 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 11:22:21,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 11:22:21,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 11:22:21,246 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 11:22:21,246 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 11:22:21,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:22:21,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:22:21,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:22:21,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:22:21,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 11:22:21,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:22:21,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:22:21,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:22:21,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:22:21,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 11:22:21,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 11:22:21,248 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 11:22:21,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 11:22:21,248 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 11:22:21,248 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 11:22:21,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 11:22:21,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 11:22:21,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 11:22:21,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 11:22:21,248 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1 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 -> 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c [2024-12-02 11:22:21,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 11:22:21,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 11:22:21,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 11:22:21,503 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 11:22:21,503 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 11:22:21,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2024-12-02 11:22:24,248 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/data/d9dfbaacf/b55d4530f323459d8fc6fd7dd44ab39b/FLAGa9dc63d46 [2024-12-02 11:22:24,453 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 11:22:24,454 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2024-12-02 11:22:24,462 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/data/d9dfbaacf/b55d4530f323459d8fc6fd7dd44ab39b/FLAGa9dc63d46 [2024-12-02 11:22:24,821 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/data/d9dfbaacf/b55d4530f323459d8fc6fd7dd44ab39b [2024-12-02 11:22:24,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 11:22:24,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 11:22:24,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 11:22:24,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 11:22:24,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 11:22:24,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:22:24" (1/1) ... [2024-12-02 11:22:24,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17244feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:24, skipping insertion in model container [2024-12-02 11:22:24,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:22:24" (1/1) ... [2024-12-02 11:22:24,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 11:22:24,966 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_c806768f-8687-4de8-b5fe-90e43da6e9dd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2024-12-02 11:22:25,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:22:25,032 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 11:22:25,040 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_c806768f-8687-4de8-b5fe-90e43da6e9dd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2024-12-02 11:22:25,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:22:25,094 INFO L204 MainTranslator]: Completed translation [2024-12-02 11:22:25,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:25 WrapperNode [2024-12-02 11:22:25,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 11:22:25,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 11:22:25,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 11:22:25,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 11:22:25,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:25" (1/1) ... [2024-12-02 11:22:25,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:25" (1/1) ... [2024-12-02 11:22:25,139 INFO L138 Inliner]: procedures = 30, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 559 [2024-12-02 11:22:25,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 11:22:25,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 11:22:25,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 11:22:25,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 11:22:25,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:25" (1/1) ... [2024-12-02 11:22:25,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:25" (1/1) ... [2024-12-02 11:22:25,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:25" (1/1) ... [2024-12-02 11:22:25,171 INFO L175 MemorySlicer]: Split 147 memory accesses to 5 slices as follows [2, 41, 11, 16, 77]. 52 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 5, 2, 1, 6]. The 18 writes are split as follows [0, 8, 2, 1, 7]. [2024-12-02 11:22:25,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:25" (1/1) ... [2024-12-02 11:22:25,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:25" (1/1) ... [2024-12-02 11:22:25,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:25" (1/1) ... [2024-12-02 11:22:25,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:25" (1/1) ... [2024-12-02 11:22:25,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:25" (1/1) ... [2024-12-02 11:22:25,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:25" (1/1) ... [2024-12-02 11:22:25,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:25" (1/1) ... [2024-12-02 11:22:25,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 11:22:25,207 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 11:22:25,207 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 11:22:25,207 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 11:22:25,208 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:25" (1/1) ... [2024-12-02 11:22:25,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:22:25,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:22:25,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 11:22:25,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 11:22:25,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 11:22:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-12-02 11:22:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-12-02 11:22:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-12-02 11:22:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-12-02 11:22:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-12-02 11:22:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-12-02 11:22:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-12-02 11:22:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-12-02 11:22:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-12-02 11:22:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-12-02 11:22:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-12-02 11:22:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-12-02 11:22:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-12-02 11:22:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-12-02 11:22:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-12-02 11:22:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 11:22:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-12-02 11:22:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-12-02 11:22:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-12-02 11:22:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-12-02 11:22:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-12-02 11:22:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-12-02 11:22:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-12-02 11:22:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-12-02 11:22:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-12-02 11:22:25,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-02 11:22:25,267 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-02 11:22:25,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 11:22:25,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 11:22:25,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-12-02 11:22:25,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-12-02 11:22:25,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-12-02 11:22:25,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-12-02 11:22:25,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-12-02 11:22:25,409 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 11:22:25,411 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 11:22:26,054 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-12-02 11:22:26,055 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 11:22:26,066 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 11:22:26,066 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 11:22:26,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:22:26 BoogieIcfgContainer [2024-12-02 11:22:26,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 11:22:26,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 11:22:26,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 11:22:26,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 11:22:26,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:22:24" (1/3) ... [2024-12-02 11:22:26,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e35625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:22:26, skipping insertion in model container [2024-12-02 11:22:26,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:25" (2/3) ... [2024-12-02 11:22:26,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e35625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:22:26, skipping insertion in model container [2024-12-02 11:22:26,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:22:26" (3/3) ... [2024-12-02 11:22:26,076 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-56.i [2024-12-02 11:22:26,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 11:22:26,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-56.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 11:22:26,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:22:26,158 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;@5b4dc7b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:22:26,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 11:22:26,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-12-02 11:22:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-02 11:22:26,174 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:26,174 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:26,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:26,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:26,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1859210493, now seen corresponding path program 1 times [2024-12-02 11:22:26,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:22:26,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198572689] [2024-12-02 11:22:26,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:26,188 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-12-02 11:22:26,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:22:26,190 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:26,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:26,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-12-02 11:22:26,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:22:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-12-02 11:22:26,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:22:26,587 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:22:26,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198572689] [2024-12-02 11:22:26,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198572689] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:22:26,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:22:26,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:22:26,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587397494] [2024-12-02 11:22:26,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:26,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 11:22:26,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:22:26,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 11:22:26,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 11:22:26,613 INFO L87 Difference]: Start difference. First operand has 118 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:22:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:26,643 INFO L93 Difference]: Finished difference Result 229 states and 363 transitions. [2024-12-02 11:22:26,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 11:22:26,646 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2024-12-02 11:22:26,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:26,653 INFO L225 Difference]: With dead ends: 229 [2024-12-02 11:22:26,653 INFO L226 Difference]: Without dead ends: 114 [2024-12-02 11:22:26,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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-12-02 11:22:26,659 INFO L435 NwaCegarLoop]: 168 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, 168 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-12-02 11:22:26,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:22:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-12-02 11:22:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-12-02 11:22:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-12-02 11:22:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 168 transitions. [2024-12-02 11:22:26,706 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 168 transitions. Word has length 149 [2024-12-02 11:22:26,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:26,707 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 168 transitions. [2024-12-02 11:22:26,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-12-02 11:22:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 168 transitions. [2024-12-02 11:22:26,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-02 11:22:26,710 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:26,710 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:26,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:26,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:26,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:26,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:26,912 INFO L85 PathProgramCache]: Analyzing trace with hash -187480061, now seen corresponding path program 1 times [2024-12-02 11:22:26,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:22:26,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164329127] [2024-12-02 11:22:26,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:26,913 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-12-02 11:22:26,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:22:26,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:26,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:27,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 11:22:27,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:22:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:27,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:22:27,245 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:22:27,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164329127] [2024-12-02 11:22:27,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164329127] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:22:27,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:22:27,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:22:27,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034228416] [2024-12-02 11:22:27,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:27,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:22:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:22:27,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:22:27,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:22:27,249 INFO L87 Difference]: Start difference. First operand 114 states and 168 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:27,284 INFO L93 Difference]: Finished difference Result 226 states and 335 transitions. [2024-12-02 11:22:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:22:27,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-12-02 11:22:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:27,287 INFO L225 Difference]: With dead ends: 226 [2024-12-02 11:22:27,287 INFO L226 Difference]: Without dead ends: 115 [2024-12-02 11:22:27,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 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-12-02 11:22:27,289 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 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-12-02 11:22:27,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:22:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-12-02 11:22:27,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-12-02 11:22:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-12-02 11:22:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2024-12-02 11:22:27,303 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 149 [2024-12-02 11:22:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:27,304 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2024-12-02 11:22:27,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2024-12-02 11:22:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-02 11:22:27,307 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:27,308 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:27,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-12-02 11:22:27,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:27,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:27,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:27,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1876423803, now seen corresponding path program 1 times [2024-12-02 11:22:27,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:22:27,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992174338] [2024-12-02 11:22:27,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:27,510 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-12-02 11:22:27,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:22:27,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:27,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:27,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-12-02 11:22:27,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:22:27,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-12-02 11:22:29,564 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 19 treesize of output 15 [2024-12-02 11:22:29,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-12-02 11:22:29,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-12-02 11:22:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 35 proven. 384 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-12-02 11:22:29,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:22:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:30,214 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:22:30,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992174338] [2024-12-02 11:22:30,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992174338] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 11:22:30,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:22:30,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [20] total 26 [2024-12-02 11:22:30,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821261753] [2024-12-02 11:22:30,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:30,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 11:22:30,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:22:30,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 11:22:30,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2024-12-02 11:22:30,217 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:30,773 INFO L93 Difference]: Finished difference Result 312 states and 459 transitions. [2024-12-02 11:22:30,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:22:30,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-12-02 11:22:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:30,775 INFO L225 Difference]: With dead ends: 312 [2024-12-02 11:22:30,775 INFO L226 Difference]: Without dead ends: 200 [2024-12-02 11:22:30,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2024-12-02 11:22:30,777 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 117 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:30,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1266 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 11:22:30,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-12-02 11:22:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2024-12-02 11:22:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 166 states have (on average 1.4096385542168675) internal successors, (234), 167 states have internal predecessors, (234), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-12-02 11:22:30,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 290 transitions. [2024-12-02 11:22:30,795 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 290 transitions. Word has length 149 [2024-12-02 11:22:30,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:30,795 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 290 transitions. [2024-12-02 11:22:30,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 290 transitions. [2024-12-02 11:22:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-02 11:22:30,798 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:30,798 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:30,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-12-02 11:22:30,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:30,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:30,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:31,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1995841667, now seen corresponding path program 1 times [2024-12-02 11:22:31,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:22:31,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922506710] [2024-12-02 11:22:31,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:31,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-12-02 11:22:31,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:22:31,002 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:31,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:31,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-12-02 11:22:31,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:22:31,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-12-02 11:22:34,574 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 19 treesize of output 15 [2024-12-02 11:22:34,686 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-12-02 11:22:34,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2024-12-02 11:22:34,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:22:34,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2024-12-02 11:22:34,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-12-02 11:22:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 35 proven. 384 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-12-02 11:22:35,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:22:35,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2024-12-02 11:22:35,642 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:22:35,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922506710] [2024-12-02 11:22:35,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922506710] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:22:35,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1861093220] [2024-12-02 11:22:35,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:35,643 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-12-02 11:22:35,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/cvc4 [2024-12-02 11:22:35,645 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-12-02 11:22:35,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-12-02 11:22:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:36,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-12-02 11:22:36,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:22:36,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-12-02 11:22:38,680 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 19 treesize of output 15 [2024-12-02 11:22:38,850 INFO L349 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2024-12-02 11:22:38,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2024-12-02 11:22:39,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-12-02 11:22:39,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-12-02 11:22:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:39,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:22:39,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1861093220] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:22:39,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:22:39,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [21] total 28 [2024-12-02 11:22:39,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91215601] [2024-12-02 11:22:39,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:39,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 11:22:39,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:22:39,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 11:22:39,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2024-12-02 11:22:39,171 INFO L87 Difference]: Start difference. First operand 197 states and 290 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:42,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:42,224 INFO L93 Difference]: Finished difference Result 881 states and 1298 transitions. [2024-12-02 11:22:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-12-02 11:22:42,225 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-12-02 11:22:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:42,229 INFO L225 Difference]: With dead ends: 881 [2024-12-02 11:22:42,229 INFO L226 Difference]: Without dead ends: 687 [2024-12-02 11:22:42,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 288 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=477, Invalid=2385, Unknown=0, NotChecked=0, Total=2862 [2024-12-02 11:22:42,231 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1357 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:42,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1357 Valid, 1437 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-12-02 11:22:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-12-02 11:22:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 421. [2024-12-02 11:22:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 360 states have (on average 1.4416666666666667) internal successors, (519), 362 states have internal predecessors, (519), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-12-02 11:22:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 631 transitions. [2024-12-02 11:22:42,278 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 631 transitions. Word has length 149 [2024-12-02 11:22:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:42,279 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 631 transitions. [2024-12-02 11:22:42,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:42,279 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 631 transitions. [2024-12-02 11:22:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-02 11:22:42,281 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:42,281 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:42,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:42,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-12-02 11:22:42,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/cvc4 --incremental --print-success --lang smt [2024-12-02 11:22:42,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:42,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:42,683 INFO L85 PathProgramCache]: Analyzing trace with hash 985722527, now seen corresponding path program 1 times [2024-12-02 11:22:42,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:22:42,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929230465] [2024-12-02 11:22:42,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:42,683 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-12-02 11:22:42,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:22:42,685 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:42,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-12-02 11:22:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:42,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 11:22:42,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:22:42,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-12-02 11:22:43,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-12-02 11:22:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 35 proven. 384 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-12-02 11:22:43,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:22:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:44,128 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:22:44,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929230465] [2024-12-02 11:22:44,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929230465] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 11:22:44,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:22:44,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-12-02 11:22:44,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265670980] [2024-12-02 11:22:44,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:44,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:22:44,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:22:44,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:22:44,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-12-02 11:22:44,130 INFO L87 Difference]: Start difference. First operand 421 states and 631 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:44,258 INFO L93 Difference]: Finished difference Result 880 states and 1321 transitions. [2024-12-02 11:22:44,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:22:44,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-12-02 11:22:44,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:44,262 INFO L225 Difference]: With dead ends: 880 [2024-12-02 11:22:44,262 INFO L226 Difference]: Without dead ends: 462 [2024-12-02 11:22:44,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-12-02 11:22:44,264 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 142 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:44,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 510 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:22:44,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-12-02 11:22:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 428. [2024-12-02 11:22:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 367 states have (on average 1.435967302452316) internal successors, (527), 369 states have internal predecessors, (527), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-12-02 11:22:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 639 transitions. [2024-12-02 11:22:44,296 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 639 transitions. Word has length 150 [2024-12-02 11:22:44,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:44,297 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 639 transitions. [2024-12-02 11:22:44,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:44,297 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 639 transitions. [2024-12-02 11:22:44,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-02 11:22:44,298 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:44,298 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:44,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-12-02 11:22:44,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:44,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:44,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:44,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1804936461, now seen corresponding path program 1 times [2024-12-02 11:22:44,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:22:44,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100880439] [2024-12-02 11:22:44,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:44,500 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-12-02 11:22:44,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:22:44,502 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:44,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:44,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-12-02 11:22:44,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:22:44,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-12-02 11:22:45,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-12-02 11:22:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-12-02 11:22:45,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:22:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 11:22:45,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:22:45,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100880439] [2024-12-02 11:22:45,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100880439] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 11:22:45,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 11:22:45,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-12-02 11:22:45,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008704313] [2024-12-02 11:22:45,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:22:45,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:22:45,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:22:45,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:22:45,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-12-02 11:22:45,480 INFO L87 Difference]: Start difference. First operand 428 states and 639 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:45,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:22:45,677 INFO L93 Difference]: Finished difference Result 902 states and 1345 transitions. [2024-12-02 11:22:45,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:22:45,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-12-02 11:22:45,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:22:45,681 INFO L225 Difference]: With dead ends: 902 [2024-12-02 11:22:45,681 INFO L226 Difference]: Without dead ends: 477 [2024-12-02 11:22:45,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-12-02 11:22:45,682 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 145 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:22:45,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 648 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:22:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-12-02 11:22:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 423. [2024-12-02 11:22:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 362 states have (on average 1.4281767955801106) internal successors, (517), 364 states have internal predecessors, (517), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-12-02 11:22:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 629 transitions. [2024-12-02 11:22:45,712 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 629 transitions. Word has length 150 [2024-12-02 11:22:45,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:22:45,713 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 629 transitions. [2024-12-02 11:22:45,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-12-02 11:22:45,713 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 629 transitions. [2024-12-02 11:22:45,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-02 11:22:45,715 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:22:45,715 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:22:45,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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)] Forceful destruction successful, exit code 0 [2024-12-02 11:22:45,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:45,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:22:45,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:22:45,916 INFO L85 PathProgramCache]: Analyzing trace with hash 31387903, now seen corresponding path program 1 times [2024-12-02 11:22:45,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:22:45,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490672524] [2024-12-02 11:22:45,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:22:45,917 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-12-02 11:22:45,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:22:45,919 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:22:45,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-12-02 11:22:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:22:46,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-12-02 11:22:46,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:22:52,098 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 32 treesize of output 16 [2024-12-02 11:22:53,359 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 38 treesize of output 36 [2024-12-02 11:22:55,120 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 55 treesize of output 52 [2024-12-02 11:22:57,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2024-12-02 11:23:01,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 95 [2024-12-02 11:23:03,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2024-12-02 11:23:04,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:23:04,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 111 treesize of output 63 [2024-12-02 11:23:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 91 proven. 437 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-12-02 11:23:04,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:23:09,899 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:23:09,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490672524] [2024-12-02 11:23:09,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490672524] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:23:09,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [908410761] [2024-12-02 11:23:09,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:23:09,899 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-12-02 11:23:09,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/cvc4 [2024-12-02 11:23:09,900 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-12-02 11:23:09,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-12-02 11:23:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:23:10,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-12-02 11:23:10,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:23:15,152 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 29 treesize of output 24 [2024-12-02 11:23:17,305 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 46 treesize of output 40 [2024-12-02 11:23:18,426 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 49 treesize of output 39 [2024-12-02 11:23:20,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2024-12-02 11:23:27,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 107 [2024-12-02 11:23:30,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 79 [2024-12-02 11:23:30,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2024-12-02 11:23:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 300 proven. 148 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-12-02 11:23:32,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:23:39,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 57 [2024-12-02 11:23:40,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [908410761] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:23:40,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 11:23:40,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 32] total 73 [2024-12-02 11:23:40,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747995465] [2024-12-02 11:23:40,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 11:23:40,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-12-02 11:23:40,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:23:40,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-12-02 11:23:40,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=9302, Unknown=0, NotChecked=0, Total=9900 [2024-12-02 11:23:40,073 INFO L87 Difference]: Start difference. First operand 423 states and 629 transitions. Second operand has 74 states, 65 states have (on average 2.4307692307692306) internal successors, (158), 64 states have internal predecessors, (158), 18 states have call successors, (38), 12 states have call predecessors, (38), 18 states have return successors, (38), 15 states have call predecessors, (38), 18 states have call successors, (38) [2024-12-02 11:24:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:24:29,618 INFO L93 Difference]: Finished difference Result 963 states and 1405 transitions. [2024-12-02 11:24:29,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-12-02 11:24:29,619 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 65 states have (on average 2.4307692307692306) internal successors, (158), 64 states have internal predecessors, (158), 18 states have call successors, (38), 12 states have call predecessors, (38), 18 states have return successors, (38), 15 states have call predecessors, (38), 18 states have call successors, (38) Word has length 151 [2024-12-02 11:24:29,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:24:29,621 INFO L225 Difference]: With dead ends: 963 [2024-12-02 11:24:29,621 INFO L226 Difference]: Without dead ends: 543 [2024-12-02 11:24:29,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5994 ImplicationChecksByTransitivity, 58.5s TimeCoverageRelationStatistics Valid=2423, Invalid=20833, Unknown=0, NotChecked=0, Total=23256 [2024-12-02 11:24:29,626 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 1704 mSDsluCounter, 7824 mSDsCounter, 0 mSdLazyCounter, 6370 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 8022 SdHoareTripleChecker+Invalid, 6795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 6370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:24:29,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 8022 Invalid, 6795 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [425 Valid, 6370 Invalid, 0 Unknown, 0 Unchecked, 21.1s Time] [2024-12-02 11:24:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-12-02 11:24:29,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 468. [2024-12-02 11:24:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 401 states have (on average 1.4139650872817955) internal successors, (567), 403 states have internal predecessors, (567), 56 states have call successors, (56), 10 states have call predecessors, (56), 10 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-12-02 11:24:29,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 679 transitions. [2024-12-02 11:24:29,693 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 679 transitions. Word has length 151 [2024-12-02 11:24:29,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:24:29,694 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 679 transitions. [2024-12-02 11:24:29,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 65 states have (on average 2.4307692307692306) internal successors, (158), 64 states have internal predecessors, (158), 18 states have call successors, (38), 12 states have call predecessors, (38), 18 states have return successors, (38), 15 states have call predecessors, (38), 18 states have call successors, (38) [2024-12-02 11:24:29,694 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 679 transitions. [2024-12-02 11:24:29,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-02 11:24:29,695 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:24:29,695 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:24:29,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-12-02 11:24:29,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-12-02 11:24:30,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/cvc4 --incremental --print-success --lang smt [2024-12-02 11:24:30,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:24:30,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:24:30,097 INFO L85 PathProgramCache]: Analyzing trace with hash -391313923, now seen corresponding path program 1 times [2024-12-02 11:24:30,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:24:30,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731043279] [2024-12-02 11:24:30,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:30,097 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-12-02 11:24:30,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 11:24:30,099 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:24:30,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:24:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:30,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-12-02 11:24:30,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:24:30,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-12-02 11:24:36,978 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-12-02 11:24:38,084 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-12-02 11:24:40,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2024-12-02 11:24:40,625 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 70 treesize of output 63 [2024-12-02 11:24:41,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2024-12-02 11:24:41,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-02 11:24:41,433 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 89 treesize of output 49 [2024-12-02 11:24:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 52 proven. 434 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-12-02 11:24:41,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:24:54,328 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:24:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731043279] [2024-12-02 11:24:54,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731043279] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 11:24:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1616609402] [2024-12-02 11:24:54,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:24:54,328 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-12-02 11:24:54,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/cvc4 [2024-12-02 11:24:54,330 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-12-02 11:24:54,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-12-02 11:24:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:24:55,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-12-02 11:24:55,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:24:55,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-12-02 11:25:02,033 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-12-02 11:25:04,348 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 33 treesize of output 17 [2024-12-02 11:25:08,883 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 75 treesize of output 61 [2024-12-02 11:25:09,539 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 88 treesize of output 73 [2024-12-02 11:25:10,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2024-12-02 11:25:11,226 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 0 case distinctions, treesize of input 107 treesize of output 59 [2024-12-02 11:25:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 124 proven. 139 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-12-02 11:25:11,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:25:17,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 140 [2024-12-02 11:27:38,416 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-12-02 11:27:38,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-12-02 11:27:38,416 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-12-02 11:27:38,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-12-02 11:27:38,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:27:38,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 11:27:38,818 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-12-02 11:27:38,821 INFO L158 Benchmark]: Toolchain (without parser) took 313997.77ms. Allocated memory was 92.3MB in the beginning and 327.2MB in the end (delta: 234.9MB). Free memory was 69.6MB in the beginning and 127.4MB in the end (delta: -57.8MB). Peak memory consumption was 173.2MB. Max. memory is 16.1GB. [2024-12-02 11:27:38,821 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:27:38,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.43ms. Allocated memory is still 92.3MB. Free memory was 69.4MB in the beginning and 52.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 11:27:38,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.77ms. Allocated memory is still 92.3MB. Free memory was 52.8MB in the beginning and 49.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:27:38,822 INFO L158 Benchmark]: Boogie Preprocessor took 66.59ms. Allocated memory is still 92.3MB. Free memory was 49.6MB in the beginning and 44.7MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 11:27:38,822 INFO L158 Benchmark]: RCFGBuilder took 860.24ms. Allocated memory is still 92.3MB. Free memory was 44.7MB in the beginning and 61.9MB in the end (delta: -17.1MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-12-02 11:27:38,822 INFO L158 Benchmark]: TraceAbstraction took 312751.56ms. Allocated memory was 92.3MB in the beginning and 327.2MB in the end (delta: 234.9MB). Free memory was 61.4MB in the beginning and 127.4MB in the end (delta: -65.9MB). Peak memory consumption was 165.6MB. Max. memory is 16.1GB. [2024-12-02 11:27:38,823 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.39ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.43ms. Allocated memory is still 92.3MB. Free memory was 69.4MB in the beginning and 52.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.77ms. Allocated memory is still 92.3MB. Free memory was 52.8MB in the beginning and 49.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.59ms. Allocated memory is still 92.3MB. Free memory was 49.6MB in the beginning and 44.7MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 860.24ms. Allocated memory is still 92.3MB. Free memory was 44.7MB in the beginning and 61.9MB in the end (delta: -17.1MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * TraceAbstraction took 312751.56ms. Allocated memory was 92.3MB in the beginning and 327.2MB in the end (delta: 234.9MB). Free memory was 61.4MB in the beginning and 127.4MB in the end (delta: -65.9MB). Peak memory consumption was 165.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c806768f-8687-4de8-b5fe-90e43da6e9dd/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")