./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya --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 d023369b57015b0448fa000adefc11450489c47a7d6ec713392eb13d9ca97ac2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:05:38,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:05:38,848 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:05:38,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:05:38,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:05:38,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:05:38,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:05:38,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:05:38,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:05:38,878 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:05:38,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:05:38,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:05:38,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:05:38,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:05:38,881 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:05:38,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:05:38,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:05:38,882 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:05:38,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:05:38,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:05:38,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:05:38,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:05:38,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:05:38,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:05:38,885 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:05:38,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:05:38,886 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:05:38,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:05:38,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:05:38,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:05:38,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:05:38,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:05:38,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:05:38,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:05:38,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:05:38,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:05:38,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:05:38,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:05:38,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:05:38,889 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:05:38,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:05:38,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:05:38,890 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya 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 -> d023369b57015b0448fa000adefc11450489c47a7d6ec713392eb13d9ca97ac2 [2023-11-29 03:05:39,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:05:39,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:05:39,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:05:39,164 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:05:39,164 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:05:39,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i [2023-11-29 03:05:41,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:05:42,110 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:05:42,111 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i [2023-11-29 03:05:42,121 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/data/4cacd1dab/f44d7c8696b44318b2ca78b2eca5e945/FLAGc93f86f4e [2023-11-29 03:05:42,136 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/data/4cacd1dab/f44d7c8696b44318b2ca78b2eca5e945 [2023-11-29 03:05:42,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:05:42,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:05:42,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:05:42,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:05:42,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:05:42,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:05:42" (1/1) ... [2023-11-29 03:05:42,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@500b729a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:42, skipping insertion in model container [2023-11-29 03:05:42,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:05:42" (1/1) ... [2023-11-29 03:05:42,193 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:05:42,362 WARN L240 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_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i[917,930] [2023-11-29 03:05:42,422 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:05:42,438 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:05:42,449 WARN L240 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_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i[917,930] [2023-11-29 03:05:42,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:05:42,501 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:05:42,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:42 WrapperNode [2023-11-29 03:05:42,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:05:42,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:05:42,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:05:42,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:05:42,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:42" (1/1) ... [2023-11-29 03:05:42,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:42" (1/1) ... [2023-11-29 03:05:42,559 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 382 [2023-11-29 03:05:42,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:05:42,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:05:42,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:05:42,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:05:42,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:42" (1/1) ... [2023-11-29 03:05:42,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:42" (1/1) ... [2023-11-29 03:05:42,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:42" (1/1) ... [2023-11-29 03:05:42,597 INFO L175 MemorySlicer]: Split 107 memory accesses to 6 slices as follows [2, 40, 15, 38, 6, 6]. 37 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 4, 1, 1]. The 17 writes are split as follows [0, 7, 2, 6, 1, 1]. [2023-11-29 03:05:42,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:42" (1/1) ... [2023-11-29 03:05:42,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:42" (1/1) ... [2023-11-29 03:05:42,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:42" (1/1) ... [2023-11-29 03:05:42,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:42" (1/1) ... [2023-11-29 03:05:42,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:42" (1/1) ... [2023-11-29 03:05:42,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:42" (1/1) ... [2023-11-29 03:05:42,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:05:42,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:05:42,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:05:42,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:05:42,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:42" (1/1) ... [2023-11-29 03:05:42,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:05:42,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:05:42,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:05:42,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:05:42,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:05:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-29 03:05:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-29 03:05:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-11-29 03:05:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-11-29 03:05:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-11-29 03:05:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-11-29 03:05:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:05:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:05:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 03:05:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 03:05:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 03:05:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 03:05:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-29 03:05:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-29 03:05:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-11-29 03:05:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-11-29 03:05:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-11-29 03:05:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-11-29 03:05:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 03:05:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 03:05:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 03:05:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 03:05:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 03:05:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 03:05:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-29 03:05:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-29 03:05:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-11-29 03:05:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-11-29 03:05:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-11-29 03:05:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-11-29 03:05:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:05:42,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:05:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:05:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:05:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 03:05:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 03:05:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 03:05:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 03:05:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:05:42,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:05:42,854 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:05:42,856 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:05:43,208 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:05:43,249 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:05:43,250 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:05:43,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:05:43 BoogieIcfgContainer [2023-11-29 03:05:43,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:05:43,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:05:43,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:05:43,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:05:43,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:05:42" (1/3) ... [2023-11-29 03:05:43,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ec7a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:05:43, skipping insertion in model container [2023-11-29 03:05:43,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:05:42" (2/3) ... [2023-11-29 03:05:43,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ec7a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:05:43, skipping insertion in model container [2023-11-29 03:05:43,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:05:43" (3/3) ... [2023-11-29 03:05:43,258 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-76.i [2023-11-29 03:05:43,274 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:05:43,274 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:05:43,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:05:43,324 INFO L357 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, mHoare=true, 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;@1b0af35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:05:43,324 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:05:43,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 03:05:43,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:43,341 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:43,342 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:43,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1477510055, now seen corresponding path program 1 times [2023-11-29 03:05:43,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:43,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033924641] [2023-11-29 03:05:43,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:43,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:43,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:43,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033924641] [2023-11-29 03:05:43,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033924641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:43,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:43,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:05:43,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37411336] [2023-11-29 03:05:43,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:43,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:05:43,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:43,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:05:43,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:05:43,782 INFO L87 Difference]: Start difference. First operand has 95 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 03:05:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:43,825 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2023-11-29 03:05:43,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:05:43,827 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2023-11-29 03:05:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:43,836 INFO L225 Difference]: With dead ends: 183 [2023-11-29 03:05:43,836 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 03:05:43,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:05:43,843 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:43,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:05:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 03:05:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-29 03:05:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2023-11-29 03:05:43,890 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2023-11-29 03:05:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:43,891 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2023-11-29 03:05:43,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 03:05:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2023-11-29 03:05:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 03:05:43,894 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:43,895 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:43,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:05:43,895 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:43,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:43,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1742220379, now seen corresponding path program 1 times [2023-11-29 03:05:43,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:43,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031186468] [2023-11-29 03:05:43,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:43,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:44,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:44,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031186468] [2023-11-29 03:05:44,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031186468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:44,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:44,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:05:44,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655170034] [2023-11-29 03:05:44,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:44,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:05:44,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:44,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:05:44,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:05:44,271 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:44,304 INFO L93 Difference]: Finished difference Result 177 states and 255 transitions. [2023-11-29 03:05:44,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:05:44,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2023-11-29 03:05:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:44,308 INFO L225 Difference]: With dead ends: 177 [2023-11-29 03:05:44,308 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 03:05:44,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:05:44,311 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:44,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:05:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 03:05:44,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-29 03:05:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2023-11-29 03:05:44,324 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 114 [2023-11-29 03:05:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:44,326 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2023-11-29 03:05:44,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:44,327 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2023-11-29 03:05:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 03:05:44,330 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:44,330 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:44,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:05:44,330 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:44,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:44,331 INFO L85 PathProgramCache]: Analyzing trace with hash -851152689, now seen corresponding path program 1 times [2023-11-29 03:05:44,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:44,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630355495] [2023-11-29 03:05:44,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:44,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:45,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:45,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630355495] [2023-11-29 03:05:45,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630355495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:45,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:45,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:05:45,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121902334] [2023-11-29 03:05:45,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:45,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:05:45,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:45,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:05:45,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:05:45,841 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:46,188 INFO L93 Difference]: Finished difference Result 225 states and 321 transitions. [2023-11-29 03:05:46,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:05:46,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2023-11-29 03:05:46,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:46,192 INFO L225 Difference]: With dead ends: 225 [2023-11-29 03:05:46,192 INFO L226 Difference]: Without dead ends: 137 [2023-11-29 03:05:46,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:05:46,194 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 284 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:46,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 448 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:05:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-29 03:05:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 108. [2023-11-29 03:05:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 91 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2023-11-29 03:05:46,212 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 115 [2023-11-29 03:05:46,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:46,213 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2023-11-29 03:05:46,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2023-11-29 03:05:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 03:05:46,215 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:46,215 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:46,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:05:46,216 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:46,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:46,216 INFO L85 PathProgramCache]: Analyzing trace with hash -33504239, now seen corresponding path program 1 times [2023-11-29 03:05:46,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:46,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766713005] [2023-11-29 03:05:46,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:46,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:46,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:46,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766713005] [2023-11-29 03:05:46,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766713005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:46,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:46,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:05:46,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344543650] [2023-11-29 03:05:46,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:46,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:05:46,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:46,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:05:46,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:05:46,431 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 03:05:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:46,572 INFO L93 Difference]: Finished difference Result 240 states and 340 transitions. [2023-11-29 03:05:46,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:05:46,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 115 [2023-11-29 03:05:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:46,574 INFO L225 Difference]: With dead ends: 240 [2023-11-29 03:05:46,575 INFO L226 Difference]: Without dead ends: 133 [2023-11-29 03:05:46,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:05:46,577 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 130 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:46,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 316 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:05:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-29 03:05:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 89. [2023-11-29 03:05:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 72 states have internal predecessors, (95), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2023-11-29 03:05:46,592 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 115 [2023-11-29 03:05:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:46,593 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2023-11-29 03:05:46,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 03:05:46,594 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2023-11-29 03:05:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-29 03:05:46,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:46,596 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:46,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:05:46,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:46,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:46,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1544613980, now seen corresponding path program 1 times [2023-11-29 03:05:46,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:46,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889419369] [2023-11-29 03:05:46,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:46,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:46,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:46,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889419369] [2023-11-29 03:05:46,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889419369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:46,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:46,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:05:46,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591066034] [2023-11-29 03:05:46,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:46,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:05:46,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:46,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:05:46,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:05:46,811 INFO L87 Difference]: Start difference. First operand 89 states and 125 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:46,877 INFO L93 Difference]: Finished difference Result 196 states and 276 transitions. [2023-11-29 03:05:46,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:05:46,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2023-11-29 03:05:46,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:46,879 INFO L225 Difference]: With dead ends: 196 [2023-11-29 03:05:46,879 INFO L226 Difference]: Without dead ends: 108 [2023-11-29 03:05:46,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:05:46,881 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 72 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:46,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 477 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:05:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-29 03:05:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2023-11-29 03:05:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 75 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2023-11-29 03:05:46,908 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 117 [2023-11-29 03:05:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:46,908 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2023-11-29 03:05:46,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2023-11-29 03:05:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 03:05:46,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:46,910 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:46,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:05:46,911 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:46,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:46,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1014613558, now seen corresponding path program 1 times [2023-11-29 03:05:46,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:46,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012241255] [2023-11-29 03:05:46,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:46,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:47,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:47,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012241255] [2023-11-29 03:05:47,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012241255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:47,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:47,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:05:47,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594848067] [2023-11-29 03:05:47,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:47,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:05:47,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:47,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:05:47,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:05:47,133 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:47,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:47,259 INFO L93 Difference]: Finished difference Result 219 states and 306 transitions. [2023-11-29 03:05:47,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:05:47,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-11-29 03:05:47,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:47,261 INFO L225 Difference]: With dead ends: 219 [2023-11-29 03:05:47,261 INFO L226 Difference]: Without dead ends: 128 [2023-11-29 03:05:47,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:05:47,263 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 99 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:47,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 638 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:05:47,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-29 03:05:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2023-11-29 03:05:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2023-11-29 03:05:47,279 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 119 [2023-11-29 03:05:47,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:47,279 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2023-11-29 03:05:47,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:47,280 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2023-11-29 03:05:47,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 03:05:47,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:47,282 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:47,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:05:47,282 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:47,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:47,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1451557819, now seen corresponding path program 1 times [2023-11-29 03:05:47,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:47,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305810501] [2023-11-29 03:05:47,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:47,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:48,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:48,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305810501] [2023-11-29 03:05:48,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305810501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:48,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:48,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:05:48,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482238055] [2023-11-29 03:05:48,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:48,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:05:48,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:48,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:05:48,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:05:48,102 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:48,430 INFO L93 Difference]: Finished difference Result 260 states and 359 transitions. [2023-11-29 03:05:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:05:48,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2023-11-29 03:05:48,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:48,432 INFO L225 Difference]: With dead ends: 260 [2023-11-29 03:05:48,432 INFO L226 Difference]: Without dead ends: 168 [2023-11-29 03:05:48,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:05:48,433 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 268 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:48,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 382 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:05:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-29 03:05:48,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 105. [2023-11-29 03:05:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 146 transitions. [2023-11-29 03:05:48,448 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 146 transitions. Word has length 121 [2023-11-29 03:05:48,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:48,449 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 146 transitions. [2023-11-29 03:05:48,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 146 transitions. [2023-11-29 03:05:48,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 03:05:48,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:48,451 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:48,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:05:48,451 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:48,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1964916067, now seen corresponding path program 1 times [2023-11-29 03:05:48,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:48,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220574982] [2023-11-29 03:05:48,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:48,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:48,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:48,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220574982] [2023-11-29 03:05:48,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220574982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:48,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:48,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:05:48,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288266354] [2023-11-29 03:05:48,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:48,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:05:48,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:48,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:05:48,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:05:48,675 INFO L87 Difference]: Start difference. First operand 105 states and 146 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:48,725 INFO L93 Difference]: Finished difference Result 209 states and 291 transitions. [2023-11-29 03:05:48,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:05:48,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2023-11-29 03:05:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:48,727 INFO L225 Difference]: With dead ends: 209 [2023-11-29 03:05:48,727 INFO L226 Difference]: Without dead ends: 105 [2023-11-29 03:05:48,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:05:48,729 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 33 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:48,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 305 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:05:48,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-29 03:05:48,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-11-29 03:05:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2023-11-29 03:05:48,741 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 121 [2023-11-29 03:05:48,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:48,742 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2023-11-29 03:05:48,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2023-11-29 03:05:48,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-29 03:05:48,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:48,744 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:48,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 03:05:48,744 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:48,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:48,744 INFO L85 PathProgramCache]: Analyzing trace with hash -83342592, now seen corresponding path program 1 times [2023-11-29 03:05:48,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:48,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382384350] [2023-11-29 03:05:48,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:48,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:48,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:49,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:49,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:49,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:49,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:49,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382384350] [2023-11-29 03:05:49,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382384350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:49,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:49,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:05:49,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199073147] [2023-11-29 03:05:49,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:49,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:05:49,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:49,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:05:49,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:05:49,016 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:49,134 INFO L93 Difference]: Finished difference Result 210 states and 288 transitions. [2023-11-29 03:05:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:05:49,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2023-11-29 03:05:49,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:49,138 INFO L225 Difference]: With dead ends: 210 [2023-11-29 03:05:49,138 INFO L226 Difference]: Without dead ends: 106 [2023-11-29 03:05:49,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:05:49,140 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 8 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:49,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 426 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:05:49,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-29 03:05:49,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2023-11-29 03:05:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 143 transitions. [2023-11-29 03:05:49,152 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 143 transitions. Word has length 123 [2023-11-29 03:05:49,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:49,153 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 143 transitions. [2023-11-29 03:05:49,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 143 transitions. [2023-11-29 03:05:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-29 03:05:49,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:49,155 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:49,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:05:49,155 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:49,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:49,155 INFO L85 PathProgramCache]: Analyzing trace with hash -617947089, now seen corresponding path program 1 times [2023-11-29 03:05:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:49,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657204623] [2023-11-29 03:05:49,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:49,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:50,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:50,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657204623] [2023-11-29 03:05:50,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657204623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:50,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:50,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:05:50,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127973068] [2023-11-29 03:05:50,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:50,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:05:50,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:50,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:05:50,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:05:50,411 INFO L87 Difference]: Start difference. First operand 105 states and 143 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 03:05:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:51,053 INFO L93 Difference]: Finished difference Result 300 states and 407 transitions. [2023-11-29 03:05:51,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:05:51,054 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2023-11-29 03:05:51,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:51,056 INFO L225 Difference]: With dead ends: 300 [2023-11-29 03:05:51,056 INFO L226 Difference]: Without dead ends: 196 [2023-11-29 03:05:51,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:05:51,058 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 430 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:51,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 762 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:05:51,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-11-29 03:05:51,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2023-11-29 03:05:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 163 states have internal predecessors, (210), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 03:05:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 250 transitions. [2023-11-29 03:05:51,094 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 250 transitions. Word has length 123 [2023-11-29 03:05:51,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:51,095 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 250 transitions. [2023-11-29 03:05:51,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 03:05:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 250 transitions. [2023-11-29 03:05:51,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 03:05:51,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:51,097 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:51,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 03:05:51,098 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:51,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:51,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1585642587, now seen corresponding path program 1 times [2023-11-29 03:05:51,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:51,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542153431] [2023-11-29 03:05:51,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:51,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:51,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:51,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542153431] [2023-11-29 03:05:51,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542153431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:51,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:51,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:05:51,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803079818] [2023-11-29 03:05:51,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:51,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:05:51,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:51,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:05:51,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:05:51,558 INFO L87 Difference]: Start difference. First operand 185 states and 250 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 03:05:51,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:51,920 INFO L93 Difference]: Finished difference Result 396 states and 534 transitions. [2023-11-29 03:05:51,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:05:51,921 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2023-11-29 03:05:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:51,923 INFO L225 Difference]: With dead ends: 396 [2023-11-29 03:05:51,923 INFO L226 Difference]: Without dead ends: 212 [2023-11-29 03:05:51,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:05:51,925 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 202 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:51,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 664 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:05:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-11-29 03:05:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 154. [2023-11-29 03:05:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 136 states have (on average 1.2720588235294117) internal successors, (173), 136 states have internal predecessors, (173), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 203 transitions. [2023-11-29 03:05:51,955 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 203 transitions. Word has length 124 [2023-11-29 03:05:51,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:51,969 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 203 transitions. [2023-11-29 03:05:51,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 03:05:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 203 transitions. [2023-11-29 03:05:51,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 03:05:51,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:51,971 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:51,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 03:05:51,972 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:51,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1639445766, now seen corresponding path program 1 times [2023-11-29 03:05:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:51,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827215209] [2023-11-29 03:05:51,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:51,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:52,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:52,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827215209] [2023-11-29 03:05:52,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827215209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:52,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:52,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:05:52,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871584668] [2023-11-29 03:05:52,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:52,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:05:52,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:52,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:05:52,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:05:52,087 INFO L87 Difference]: Start difference. First operand 154 states and 203 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:52,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:52,131 INFO L93 Difference]: Finished difference Result 311 states and 413 transitions. [2023-11-29 03:05:52,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:05:52,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-11-29 03:05:52,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:52,133 INFO L225 Difference]: With dead ends: 311 [2023-11-29 03:05:52,133 INFO L226 Difference]: Without dead ends: 158 [2023-11-29 03:05:52,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:05:52,135 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 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 [2023-11-29 03:05:52,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:05:52,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-29 03:05:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2023-11-29 03:05:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 140 states have (on average 1.2642857142857142) internal successors, (177), 140 states have internal predecessors, (177), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 207 transitions. [2023-11-29 03:05:52,162 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 207 transitions. Word has length 125 [2023-11-29 03:05:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:52,163 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 207 transitions. [2023-11-29 03:05:52,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 207 transitions. [2023-11-29 03:05:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 03:05:52,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:52,165 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:52,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 03:05:52,165 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:52,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:52,165 INFO L85 PathProgramCache]: Analyzing trace with hash -49497976, now seen corresponding path program 1 times [2023-11-29 03:05:52,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:52,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423744489] [2023-11-29 03:05:52,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:52,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:52,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:52,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423744489] [2023-11-29 03:05:52,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423744489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:52,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:52,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:05:52,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307859178] [2023-11-29 03:05:52,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:52,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:05:52,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:52,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:05:52,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:05:52,663 INFO L87 Difference]: Start difference. First operand 158 states and 207 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:53,009 INFO L93 Difference]: Finished difference Result 362 states and 467 transitions. [2023-11-29 03:05:53,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:05:53,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-11-29 03:05:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:53,012 INFO L225 Difference]: With dead ends: 362 [2023-11-29 03:05:53,012 INFO L226 Difference]: Without dead ends: 205 [2023-11-29 03:05:53,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:05:53,013 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 150 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:53,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 494 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:05:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-29 03:05:53,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 156. [2023-11-29 03:05:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 138 states have (on average 1.2536231884057971) internal successors, (173), 138 states have internal predecessors, (173), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 203 transitions. [2023-11-29 03:05:53,044 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 203 transitions. Word has length 125 [2023-11-29 03:05:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:53,045 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 203 transitions. [2023-11-29 03:05:53,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2023-11-29 03:05:53,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 03:05:53,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:53,047 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:53,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 03:05:53,047 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:53,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2025691798, now seen corresponding path program 1 times [2023-11-29 03:05:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:53,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764728857] [2023-11-29 03:05:53,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:53,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:53,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764728857] [2023-11-29 03:05:53,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764728857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:53,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:53,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:05:53,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960926739] [2023-11-29 03:05:53,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:53,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:05:53,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:53,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:05:53,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:05:53,645 INFO L87 Difference]: Start difference. First operand 156 states and 203 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:53,888 INFO L93 Difference]: Finished difference Result 208 states and 262 transitions. [2023-11-29 03:05:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:05:53,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-11-29 03:05:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:53,891 INFO L225 Difference]: With dead ends: 208 [2023-11-29 03:05:53,891 INFO L226 Difference]: Without dead ends: 206 [2023-11-29 03:05:53,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:05:53,892 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 166 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:53,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 476 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:05:53,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-11-29 03:05:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2023-11-29 03:05:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 176 states have (on average 1.2215909090909092) internal successors, (215), 176 states have internal predecessors, (215), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 245 transitions. [2023-11-29 03:05:53,919 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 245 transitions. Word has length 125 [2023-11-29 03:05:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:53,920 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 245 transitions. [2023-11-29 03:05:53,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 245 transitions. [2023-11-29 03:05:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 03:05:53,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:53,922 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:53,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 03:05:53,922 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:53,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:53,923 INFO L85 PathProgramCache]: Analyzing trace with hash 198508777, now seen corresponding path program 1 times [2023-11-29 03:05:53,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:53,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236828253] [2023-11-29 03:05:53,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:53,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:54,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:54,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236828253] [2023-11-29 03:05:54,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236828253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:54,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:54,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:05:54,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237805756] [2023-11-29 03:05:54,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:54,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:05:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:54,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:05:54,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:05:54,350 INFO L87 Difference]: Start difference. First operand 194 states and 245 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 03:05:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:54,637 INFO L93 Difference]: Finished difference Result 433 states and 552 transitions. [2023-11-29 03:05:54,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:05:54,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 125 [2023-11-29 03:05:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:54,640 INFO L225 Difference]: With dead ends: 433 [2023-11-29 03:05:54,640 INFO L226 Difference]: Without dead ends: 240 [2023-11-29 03:05:54,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:05:54,641 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 237 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:54,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 440 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:05:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-11-29 03:05:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 194. [2023-11-29 03:05:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 176 states have (on average 1.2102272727272727) internal successors, (213), 176 states have internal predecessors, (213), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 243 transitions. [2023-11-29 03:05:54,669 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 243 transitions. Word has length 125 [2023-11-29 03:05:54,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:54,670 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 243 transitions. [2023-11-29 03:05:54,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 03:05:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 243 transitions. [2023-11-29 03:05:54,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 03:05:54,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:54,672 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:54,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 03:05:54,672 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:54,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:54,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2043928865, now seen corresponding path program 1 times [2023-11-29 03:05:54,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:54,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272206986] [2023-11-29 03:05:54,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:54,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,168 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:55,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:55,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272206986] [2023-11-29 03:05:55,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272206986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:55,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:55,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 03:05:55,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576383013] [2023-11-29 03:05:55,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:55,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:05:55,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:55,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:05:55,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:05:55,172 INFO L87 Difference]: Start difference. First operand 194 states and 243 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 03:05:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:55,683 INFO L93 Difference]: Finished difference Result 520 states and 657 transitions. [2023-11-29 03:05:55,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:05:55,684 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2023-11-29 03:05:55,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:55,686 INFO L225 Difference]: With dead ends: 520 [2023-11-29 03:05:55,686 INFO L226 Difference]: Without dead ends: 327 [2023-11-29 03:05:55,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2023-11-29 03:05:55,688 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 311 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:55,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1110 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:05:55,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-11-29 03:05:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 252. [2023-11-29 03:05:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 234 states have (on average 1.2136752136752136) internal successors, (284), 234 states have internal predecessors, (284), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 314 transitions. [2023-11-29 03:05:55,719 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 314 transitions. Word has length 126 [2023-11-29 03:05:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:55,719 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 314 transitions. [2023-11-29 03:05:55,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 03:05:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 314 transitions. [2023-11-29 03:05:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 03:05:55,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:55,721 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:55,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 03:05:55,722 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:55,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:55,722 INFO L85 PathProgramCache]: Analyzing trace with hash -120700831, now seen corresponding path program 1 times [2023-11-29 03:05:55,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:55,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928470107] [2023-11-29 03:05:55,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:55,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:55,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:56,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:56,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928470107] [2023-11-29 03:05:56,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928470107] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:56,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:56,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:05:56,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307933655] [2023-11-29 03:05:56,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:56,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:05:56,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:56,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:05:56,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:05:56,012 INFO L87 Difference]: Start difference. First operand 252 states and 314 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:56,189 INFO L93 Difference]: Finished difference Result 556 states and 694 transitions. [2023-11-29 03:05:56,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:05:56,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-29 03:05:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:56,192 INFO L225 Difference]: With dead ends: 556 [2023-11-29 03:05:56,192 INFO L226 Difference]: Without dead ends: 305 [2023-11-29 03:05:56,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:05:56,194 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 88 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:56,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 409 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:05:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-11-29 03:05:56,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 220. [2023-11-29 03:05:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 202 states have (on average 1.2128712871287128) internal successors, (245), 202 states have internal predecessors, (245), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 03:05:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 275 transitions. [2023-11-29 03:05:56,225 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 275 transitions. Word has length 126 [2023-11-29 03:05:56,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:56,226 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 275 transitions. [2023-11-29 03:05:56,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:56,226 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 275 transitions. [2023-11-29 03:05:56,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 03:05:56,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:56,228 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:56,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 03:05:56,229 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:56,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:56,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1754590603, now seen corresponding path program 1 times [2023-11-29 03:05:56,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:56,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329756146] [2023-11-29 03:05:56,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:56,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-29 03:05:56,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:56,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329756146] [2023-11-29 03:05:56,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329756146] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:05:56,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828394075] [2023-11-29 03:05:56,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:56,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:05:56,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:05:56,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:05:56,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:05:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:57,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 03:05:57,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:05:57,262 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 [2023-11-29 03:05:57,743 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 03:05:57,743 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 31 treesize of output 22 [2023-11-29 03:05:57,817 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 03:05:57,818 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 34 treesize of output 14 [2023-11-29 03:05:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 11 proven. 177 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2023-11-29 03:05:57,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:05:58,215 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 31 [2023-11-29 03:05:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-29 03:05:58,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828394075] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:05:58,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:05:58,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2023-11-29 03:05:58,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807329820] [2023-11-29 03:05:58,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:05:58,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 03:05:58,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:58,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 03:05:58,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2023-11-29 03:05:58,269 INFO L87 Difference]: Start difference. First operand 220 states and 275 transitions. Second operand has 21 states, 19 states have (on average 5.473684210526316) internal successors, (104), 20 states have internal predecessors, (104), 8 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 6 states have call predecessors, (45), 8 states have call successors, (45) [2023-11-29 03:05:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:59,168 INFO L93 Difference]: Finished difference Result 424 states and 518 transitions. [2023-11-29 03:05:59,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:05:59,169 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.473684210526316) internal successors, (104), 20 states have internal predecessors, (104), 8 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 6 states have call predecessors, (45), 8 states have call successors, (45) Word has length 127 [2023-11-29 03:05:59,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:59,171 INFO L225 Difference]: With dead ends: 424 [2023-11-29 03:05:59,171 INFO L226 Difference]: Without dead ends: 205 [2023-11-29 03:05:59,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 270 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 03:05:59,173 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 257 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:59,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 751 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:05:59,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-29 03:05:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2023-11-29 03:05:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 173 states have (on average 1.138728323699422) internal successors, (197), 174 states have internal predecessors, (197), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 03:05:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 231 transitions. [2023-11-29 03:05:59,195 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 231 transitions. Word has length 127 [2023-11-29 03:05:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:59,195 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 231 transitions. [2023-11-29 03:05:59,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.473684210526316) internal successors, (104), 20 states have internal predecessors, (104), 8 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 6 states have call predecessors, (45), 8 states have call successors, (45) [2023-11-29 03:05:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 231 transitions. [2023-11-29 03:05:59,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 03:05:59,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:59,197 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:59,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:05:59,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 03:05:59,398 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:59,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:59,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1935207474, now seen corresponding path program 1 times [2023-11-29 03:05:59,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:59,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134868993] [2023-11-29 03:05:59,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:59,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,618 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:59,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:59,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134868993] [2023-11-29 03:05:59,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134868993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:59,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:59,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:05:59,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741658862] [2023-11-29 03:05:59,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:59,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:05:59,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:59,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:05:59,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:05:59,621 INFO L87 Difference]: Start difference. First operand 194 states and 231 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:59,712 INFO L93 Difference]: Finished difference Result 306 states and 368 transitions. [2023-11-29 03:05:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:05:59,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-11-29 03:05:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:59,715 INFO L225 Difference]: With dead ends: 306 [2023-11-29 03:05:59,715 INFO L226 Difference]: Without dead ends: 113 [2023-11-29 03:05:59,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:05:59,716 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:59,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 360 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:05:59,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-29 03:05:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-11-29 03:05:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.108695652173913) internal successors, (102), 93 states have internal predecessors, (102), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 03:05:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 136 transitions. [2023-11-29 03:05:59,747 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 136 transitions. Word has length 127 [2023-11-29 03:05:59,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:59,747 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 136 transitions. [2023-11-29 03:05:59,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 136 transitions. [2023-11-29 03:05:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-29 03:05:59,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:59,749 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:59,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 03:05:59,749 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:59,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:59,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1730744439, now seen corresponding path program 1 times [2023-11-29 03:05:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:59,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466277862] [2023-11-29 03:05:59,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:59,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:05:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:05:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:05:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:05:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:05:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:05:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:05:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:05:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:05:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:05:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:05:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:05:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:05:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:05:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:05:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:05:59,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:05:59,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466277862] [2023-11-29 03:05:59,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466277862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:05:59,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:05:59,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:05:59,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069792041] [2023-11-29 03:05:59,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:05:59,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:05:59,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:05:59,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:05:59,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:05:59,843 INFO L87 Difference]: Start difference. First operand 113 states and 136 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:59,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:59,889 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2023-11-29 03:05:59,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:05:59,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-11-29 03:05:59,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:59,891 INFO L225 Difference]: With dead ends: 225 [2023-11-29 03:05:59,891 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 03:05:59,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:05:59,892 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:59,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 194 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:05:59,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 03:05:59,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2023-11-29 03:05:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.10752688172043) internal successors, (103), 94 states have internal predecessors, (103), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 03:05:59,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2023-11-29 03:05:59,923 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 128 [2023-11-29 03:05:59,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:59,923 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2023-11-29 03:05:59,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:05:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2023-11-29 03:05:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-29 03:05:59,925 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:59,925 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:05:59,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 03:05:59,925 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:05:59,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:59,926 INFO L85 PathProgramCache]: Analyzing trace with hash 44262923, now seen corresponding path program 1 times [2023-11-29 03:05:59,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:05:59,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173153625] [2023-11-29 03:05:59,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:05:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:06:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:06:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:06:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:06:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:06:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 03:06:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 03:06:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:06:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:06:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:06:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:06:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:06:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:06:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:06:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:06:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-29 03:06:00,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:06:00,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173153625] [2023-11-29 03:06:00,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173153625] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:06:00,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:06:00,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:06:00,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080196116] [2023-11-29 03:06:00,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:06:00,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:06:00,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:06:00,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:06:00,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:06:00,232 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:06:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:06:00,313 INFO L93 Difference]: Finished difference Result 212 states and 253 transitions. [2023-11-29 03:06:00,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:06:00,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-11-29 03:06:00,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:06:00,315 INFO L225 Difference]: With dead ends: 212 [2023-11-29 03:06:00,315 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 03:06:00,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:06:00,316 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 19 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:06:00,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 231 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:06:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 03:06:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 03:06:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:06:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 03:06:00,318 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2023-11-29 03:06:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:06:00,318 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 03:06:00,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-29 03:06:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 03:06:00,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 03:06:00,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 03:06:00,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 03:06:00,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 03:06:09,468 WARN L293 SmtUtils]: Spent 9.00s on a formula simplification. DAG size of input: 161 DAG size of output: 166 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 03:06:12,931 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 03:06:12,931 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 03:06:12,931 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 03:06:12,931 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 03:06:12,931 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 85) no Hoare annotation was computed. [2023-11-29 03:06:12,931 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 03:06:12,932 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 03:06:12,932 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 03:06:12,932 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-11-29 03:06:12,932 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-11-29 03:06:12,932 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-11-29 03:06:12,932 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-11-29 03:06:12,932 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2023-11-29 03:06:12,932 INFO L899 garLoopResultBuilder]: For program point L54-2(lines 54 58) no Hoare annotation was computed. [2023-11-29 03:06:12,932 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 75) no Hoare annotation was computed. [2023-11-29 03:06:12,933 INFO L899 garLoopResultBuilder]: For program point L71-1(lines 71 75) no Hoare annotation was computed. [2023-11-29 03:06:12,933 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (let ((.cse1 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (.cse2 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse3 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|)) (.cse4 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse5 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3))) (.cse6 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1))) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse8 (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0))) (or (and (not (= (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 (let ((.cse9 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset))) (let ((.cse12 (+ .cse9 240))) (let ((.cse10 (* 256 (div .cse12 256))) (.cse11 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (and (= .cse9 (+ 16 .cse10 .cse11)) (<= .cse9 (+ 15 (* (div (+ 112 .cse9) 256) 256)))) (and (<= (+ .cse9 113) .cse10) (= (+ .cse10 .cse11) .cse12)))))) .cse6 .cse7 .cse8))) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)))) [2023-11-29 03:06:12,933 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-11-29 03:06:12,933 INFO L895 garLoopResultBuilder]: At program point L121-2(lines 121 127) the Hoare annotation is: (let ((.cse14 (+ |~#signed_char_Array_0~0.offset| 2))) (let ((.cse1 (let ((.cse15 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (.cse16 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse17 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|)) (.cse18 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse19 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3))) (.cse20 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1))) (.cse21 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base))) (or (and (not (= (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse21) (and .cse15 .cse16 .cse17 .cse18 .cse19 (let ((.cse22 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset))) (let ((.cse25 (+ .cse22 240))) (let ((.cse23 (* 256 (div .cse25 256))) (.cse24 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (and (= .cse22 (+ 16 .cse23 .cse24)) (<= .cse22 (+ 15 (* (div (+ 112 .cse22) 256) 256)))) (and (<= (+ .cse22 113) .cse23) (= (+ .cse23 .cse24) .cse25)))))) .cse20 .cse21)))) (.cse2 (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse3 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse4 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (.cse5 (not (= .cse14 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset))) (.cse6 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset))) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1)) (.cse8 (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base)) (.cse9 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse14))) (.cse10 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse11 (= |~#BOOL_unsigned_char_Array_0~0.offset| 0)) (.cse12 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)))) (or (and (let ((.cse0 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base) ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (<= .cse0 (* 256 (div .cse0 256)))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (let ((.cse13 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse13 (* (div .cse13 256) 256))))))) [2023-11-29 03:06:12,934 INFO L899 garLoopResultBuilder]: For program point L121-3(lines 121 127) no Hoare annotation was computed. [2023-11-29 03:06:12,934 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-11-29 03:06:12,934 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-11-29 03:06:12,934 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 74) no Hoare annotation was computed. [2023-11-29 03:06:12,934 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (let ((.cse1 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (.cse2 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse3 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|)) (.cse4 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse5 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3))) (.cse6 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1))) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse8 (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0))) (or (and (not (= (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 (let ((.cse9 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset))) (let ((.cse12 (+ .cse9 240))) (let ((.cse10 (* 256 (div .cse12 256))) (.cse11 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (and (= .cse9 (+ 16 .cse10 .cse11)) (<= .cse9 (+ 15 (* (div (+ 112 .cse9) 256) 256)))) (and (<= (+ .cse9 113) .cse10) (= (+ .cse10 .cse11) .cse12)))))) .cse6 .cse7 .cse8))) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)))) [2023-11-29 03:06:12,935 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-11-29 03:06:12,935 INFO L895 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-11-29 03:06:12,935 INFO L899 garLoopResultBuilder]: For program point L106-1(line 106) no Hoare annotation was computed. [2023-11-29 03:06:12,935 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-11-29 03:06:12,935 INFO L899 garLoopResultBuilder]: For program point L73-2(line 73) no Hoare annotation was computed. [2023-11-29 03:06:12,935 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 03:06:12,936 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (let ((.cse1 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (.cse2 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse3 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|)) (.cse4 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse5 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3))) (.cse6 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1))) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse8 (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0))) (or (and (not (= (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 (let ((.cse9 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset))) (let ((.cse12 (+ .cse9 240))) (let ((.cse10 (* 256 (div .cse12 256))) (.cse11 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (and (= .cse9 (+ 16 .cse10 .cse11)) (<= .cse9 (+ 15 (* (div (+ 112 .cse9) 256) 256)))) (and (<= (+ .cse9 113) .cse10) (= (+ .cse10 .cse11) .cse12)))))) .cse6 .cse7 .cse8))) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)))) [2023-11-29 03:06:12,936 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-11-29 03:06:12,936 INFO L895 garLoopResultBuilder]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-11-29 03:06:12,936 INFO L899 garLoopResultBuilder]: For program point L108-1(line 108) no Hoare annotation was computed. [2023-11-29 03:06:12,937 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (let ((.cse1 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (.cse2 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse3 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|)) (.cse4 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse5 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3))) (.cse6 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1))) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse8 (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0))) (or (and (not (= (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 (let ((.cse9 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset))) (let ((.cse12 (+ .cse9 240))) (let ((.cse10 (* 256 (div .cse12 256))) (.cse11 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (and (= .cse9 (+ 16 .cse10 .cse11)) (<= .cse9 (+ 15 (* (div (+ 112 .cse9) 256) 256)))) (and (<= (+ .cse9 113) .cse10) (= (+ .cse10 .cse11) .cse12)))))) .cse6 .cse7 .cse8))) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= |ULTIMATE.start_updateVariables_#t~mem37#1| (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)))) [2023-11-29 03:06:12,937 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-11-29 03:06:12,937 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 69) no Hoare annotation was computed. [2023-11-29 03:06:12,937 INFO L895 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-11-29 03:06:12,937 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2023-11-29 03:06:12,937 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 84) no Hoare annotation was computed. [2023-11-29 03:06:12,937 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2023-11-29 03:06:12,937 INFO L899 garLoopResultBuilder]: For program point L60-2(line 60) no Hoare annotation was computed. [2023-11-29 03:06:12,937 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-11-29 03:06:12,938 INFO L899 garLoopResultBuilder]: For program point L77-2(lines 77 81) no Hoare annotation was computed. [2023-11-29 03:06:12,938 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-11-29 03:06:12,938 INFO L899 garLoopResultBuilder]: For program point L94-2(line 94) no Hoare annotation was computed. [2023-11-29 03:06:12,938 INFO L899 garLoopResultBuilder]: For program point L94-3(line 94) no Hoare annotation was computed. [2023-11-29 03:06:12,938 INFO L899 garLoopResultBuilder]: For program point L94-5(line 94) no Hoare annotation was computed. [2023-11-29 03:06:12,938 INFO L899 garLoopResultBuilder]: For program point L94-7(line 94) no Hoare annotation was computed. [2023-11-29 03:06:12,938 INFO L895 garLoopResultBuilder]: At program point L94-8(line 94) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (let ((.cse1 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset))) (.cse2 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse3 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|)) (.cse4 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse5 (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3))) (.cse6 (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1))) (.cse7 (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base)) (.cse8 (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0))) (or (and (not (= (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) (select (select |#memory_int#4| ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 (let ((.cse9 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset))) (let ((.cse12 (+ .cse9 240))) (let ((.cse10 (* 256 (div .cse12 256))) (.cse11 (select (select |#memory_int#3| ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (and (= .cse9 (+ 16 .cse10 .cse11)) (<= .cse9 (+ 15 (* (div (+ 112 .cse9) 256) 256)))) (and (<= (+ .cse9 113) .cse10) (= (+ .cse10 .cse11) .cse12)))))) .cse6 .cse7 .cse8))) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse13 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse13 (* (div .cse13 256) 256))))) [2023-11-29 03:06:12,939 INFO L899 garLoopResultBuilder]: For program point L94-9(line 94) no Hoare annotation was computed. [2023-11-29 03:06:12,939 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-11-29 03:06:12,939 INFO L899 garLoopResultBuilder]: For program point L78-2(line 78) no Hoare annotation was computed. [2023-11-29 03:06:12,939 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 68) no Hoare annotation was computed. [2023-11-29 03:06:12,939 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 03:06:12,939 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-11-29 03:06:12,939 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-11-29 03:06:12,940 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-11-29 03:06:12,940 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-11-29 03:06:12,940 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 67) no Hoare annotation was computed. [2023-11-29 03:06:12,940 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 59 69) no Hoare annotation was computed. [2023-11-29 03:06:12,940 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 03:06:12,940 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,940 INFO L899 garLoopResultBuilder]: For program point L115-2(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,940 INFO L899 garLoopResultBuilder]: For program point L115-3(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,940 INFO L899 garLoopResultBuilder]: For program point L115-4(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,941 INFO L899 garLoopResultBuilder]: For program point L115-5(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,941 INFO L899 garLoopResultBuilder]: For program point L115-6(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,941 INFO L899 garLoopResultBuilder]: For program point L115-8(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,941 INFO L899 garLoopResultBuilder]: For program point L115-10(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,941 INFO L899 garLoopResultBuilder]: For program point L115-12(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,941 INFO L899 garLoopResultBuilder]: For program point L115-14(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,941 INFO L899 garLoopResultBuilder]: For program point L115-15(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,941 INFO L895 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-11-29 03:06:12,941 INFO L899 garLoopResultBuilder]: For program point L115-16(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,942 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-11-29 03:06:12,942 INFO L899 garLoopResultBuilder]: For program point L115-17(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,942 INFO L899 garLoopResultBuilder]: For program point L115-19(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,942 INFO L899 garLoopResultBuilder]: For program point L115-21(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,942 INFO L899 garLoopResultBuilder]: For program point L115-23(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,942 INFO L899 garLoopResultBuilder]: For program point L115-25(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,942 INFO L899 garLoopResultBuilder]: For program point L115-26(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,942 INFO L899 garLoopResultBuilder]: For program point L115-27(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,942 INFO L899 garLoopResultBuilder]: For program point L115-29(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,942 INFO L899 garLoopResultBuilder]: For program point L115-30(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,942 INFO L899 garLoopResultBuilder]: For program point L115-31(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,943 INFO L899 garLoopResultBuilder]: For program point L115-32(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,943 INFO L899 garLoopResultBuilder]: For program point L115-34(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,943 INFO L899 garLoopResultBuilder]: For program point L115-35(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,943 INFO L899 garLoopResultBuilder]: For program point L115-37(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,943 INFO L899 garLoopResultBuilder]: For program point L115-39(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,943 INFO L899 garLoopResultBuilder]: For program point L115-41(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,943 INFO L899 garLoopResultBuilder]: For program point L115-43(line 115) no Hoare annotation was computed. [2023-11-29 03:06:12,943 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (let ((.cse0 (+ |~#signed_char_Array_0~0.offset| 2))) (and (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (not (= .cse0 ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.offset 1) (= ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base |~#signed_char_Array_0~0.base|) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse0)) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset (+ |~#signed_char_Array_0~0.offset| 3)) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.offset 1)) (not (= ~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base |~#BOOL_unsigned_char_Array_0~0.base|) (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base) (= |~#BOOL_unsigned_char_Array_0~0.offset| 0) (= (select (select |#memory_int#3| |~#signed_char_Array_0~0.base|) .cse0) ~last_1_signed_char_Array_0_1__0_~0) (not (= ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0.offset 1)) (let ((.cse1 (select (select |#memory_int#1| ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0.base) 1))) (<= .cse1 (* (div .cse1 256) 256))))) [2023-11-29 03:06:12,943 INFO L899 garLoopResultBuilder]: For program point L100-1(line 100) no Hoare annotation was computed. [2023-11-29 03:06:12,947 INFO L445 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] [2023-11-29 03:06:12,949 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:06:12,966 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,968 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,969 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,969 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,971 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,971 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,971 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,971 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,972 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,972 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,972 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,973 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,973 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,973 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,974 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,974 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,974 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,975 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,975 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,975 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,975 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,976 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,976 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,976 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,977 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,977 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated [2023-11-29 03:06:12,977 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base][1] could not be translated [2023-11-29 03:06:12,978 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base][1] could not be translated [2023-11-29 03:06:12,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:06:12 BoogieIcfgContainer [2023-11-29 03:06:12,978 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:06:12,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:06:12,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:06:12,979 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:06:12,980 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:05:43" (3/4) ... [2023-11-29 03:06:12,982 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 03:06:12,985 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 03:06:12,995 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-29 03:06:12,996 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 03:06:12,997 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 03:06:12,998 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 03:06:13,156 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 03:06:13,157 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 03:06:13,157 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:06:13,158 INFO L158 Benchmark]: Toolchain (without parser) took 31017.57ms. Allocated memory was 172.0MB in the beginning and 522.2MB in the end (delta: 350.2MB). Free memory was 136.7MB in the beginning and 431.0MB in the end (delta: -294.3MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2023-11-29 03:06:13,158 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory was 89.3MB in the beginning and 89.2MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:06:13,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.88ms. Allocated memory is still 172.0MB. Free memory was 136.2MB in the beginning and 134.6MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 03:06:13,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.74ms. Allocated memory is still 172.0MB. Free memory was 134.6MB in the beginning and 131.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:06:13,159 INFO L158 Benchmark]: Boogie Preprocessor took 64.77ms. Allocated memory is still 172.0MB. Free memory was 131.0MB in the beginning and 126.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:06:13,160 INFO L158 Benchmark]: RCFGBuilder took 624.80ms. Allocated memory is still 172.0MB. Free memory was 126.8MB in the beginning and 92.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-29 03:06:13,160 INFO L158 Benchmark]: TraceAbstraction took 29725.47ms. Allocated memory was 172.0MB in the beginning and 522.2MB in the end (delta: 350.2MB). Free memory was 92.0MB in the beginning and 442.6MB in the end (delta: -350.5MB). Peak memory consumption was 272.0MB. Max. memory is 16.1GB. [2023-11-29 03:06:13,160 INFO L158 Benchmark]: Witness Printer took 178.16ms. Allocated memory is still 522.2MB. Free memory was 441.5MB in the beginning and 431.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 03:06:13,163 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.20ms. Allocated memory is still 121.6MB. Free memory was 89.3MB in the beginning and 89.2MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.88ms. Allocated memory is still 172.0MB. Free memory was 136.2MB in the beginning and 134.6MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.74ms. Allocated memory is still 172.0MB. Free memory was 134.6MB in the beginning and 131.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.77ms. Allocated memory is still 172.0MB. Free memory was 131.0MB in the beginning and 126.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 624.80ms. Allocated memory is still 172.0MB. Free memory was 126.8MB in the beginning and 92.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 29725.47ms. Allocated memory was 172.0MB in the beginning and 522.2MB in the end (delta: 350.2MB). Free memory was 92.0MB in the beginning and 442.6MB in the end (delta: -350.5MB). Peak memory consumption was 272.0MB. Max. memory is 16.1GB. * Witness Printer took 178.16ms. Allocated memory is still 522.2MB. Free memory was 441.5MB in the beginning and 431.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base][~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base][~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base][~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base][1] could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.6s, OverallIterations: 21, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2761 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2761 mSDsluCounter, 9482 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6818 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2720 IncrementalHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 2664 mSDtfsCounter, 2720 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1094 GetRequests, 929 SyntacticMatches, 4 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=16, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 538 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 340 PreInvPairs, 359 NumberOfFragments, 2518 HoareAnnotationTreeSize, 340 FomulaSimplifications, 88148 FormulaSimplificationTreeSizeReduction, 9.6s HoareSimplificationTime, 17 FomulaSimplificationsInter, 60502 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 2695 NumberOfCodeBlocks, 2695 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2799 ConstructedInterpolants, 5 QuantifiedInterpolants, 12541 SizeOfPredicates, 11 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 9417/9660 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-29 03:06:13,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8fa78bb-510f-4ad5-a5c5-cd1a95c92919/bin/uautomizer-verify-BQ2R08f2Ya/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 Writing output log to file Ultimate.log Result: TRUE