./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:04:16,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:04:16,859 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:04:16,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:04:16,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:04:16,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:04:16,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:04:16,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:04:16,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:04:16,908 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:04:16,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:04:16,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:04:16,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:04:16,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:04:16,913 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:04:16,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:04:16,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:04:16,916 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:04:16,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:04:16,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:04:16,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:04:16,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:04:16,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:04:16,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:04:16,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:04:16,919 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:04:16,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:04:16,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:04:16,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:04:16,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:04:16,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:04:16,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:04:16,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:04:16,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:04:16,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:04:16,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:04:16,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:04:16,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:04:16,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:04:16,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:04:16,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:04:16,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:04:16,930 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_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd [2024-11-08 16:04:17,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:04:17,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:04:17,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:04:17,269 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:04:17,269 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:04:17,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i Unable to find full path for "g++" [2024-11-08 16:04:19,266 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:04:19,519 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:04:19,521 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i [2024-11-08 16:04:19,535 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/data/0ff618271/98e33b61abf142d1b1bab9c468d3af40/FLAG1f7ba3911 [2024-11-08 16:04:19,550 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/data/0ff618271/98e33b61abf142d1b1bab9c468d3af40 [2024-11-08 16:04:19,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:04:19,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:04:19,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:04:19,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:04:19,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:04:19,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:04:19" (1/1) ... [2024-11-08 16:04:19,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70aa7bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:19, skipping insertion in model container [2024-11-08 16:04:19,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:04:19" (1/1) ... [2024-11-08 16:04:19,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:04:19,821 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i[916,929] [2024-11-08 16:04:19,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:04:19,913 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:04:19,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i[916,929] [2024-11-08 16:04:19,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:04:20,027 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:04:20,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20 WrapperNode [2024-11-08 16:04:20,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:04:20,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:04:20,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:04:20,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:04:20,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,108 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 520 [2024-11-08 16:04:20,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:04:20,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:04:20,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:04:20,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:04:20,122 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,137 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 16:04:20,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:04:20,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:04:20,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:04:20,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:04:20,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (1/1) ... [2024-11-08 16:04:20,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:04:20,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:04:20,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:04:20,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:04:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:04:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 16:04:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 16:04:20,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 16:04:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 16:04:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 16:04:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 16:04:20,298 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:04:20,298 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:04:20,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 16:04:20,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:04:20,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:04:20,415 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:04:20,417 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:04:21,380 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-08 16:04:21,380 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:04:21,400 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:04:21,403 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:04:21,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:04:21 BoogieIcfgContainer [2024-11-08 16:04:21,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:04:21,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:04:21,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:04:21,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:04:21,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:04:19" (1/3) ... [2024-11-08 16:04:21,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7011837b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:04:21, skipping insertion in model container [2024-11-08 16:04:21,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:04:20" (2/3) ... [2024-11-08 16:04:21,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7011837b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:04:21, skipping insertion in model container [2024-11-08 16:04:21,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:04:21" (3/3) ... [2024-11-08 16:04:21,420 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-88.i [2024-11-08 16:04:21,441 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:04:21,442 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:04:21,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:04:21,531 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4bb5a3e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:04:21,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:04:21,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 16:04:21,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 16:04:21,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:21,558 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:21,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:21,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:21,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1975762088, now seen corresponding path program 1 times [2024-11-08 16:04:21,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:21,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659789262] [2024-11-08 16:04:21,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:21,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:04:22,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:22,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659789262] [2024-11-08 16:04:22,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659789262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:22,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:22,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:04:22,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10003758] [2024-11-08 16:04:22,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:22,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:04:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:22,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:04:22,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:04:22,341 INFO L87 Difference]: Start difference. First operand has 119 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:04:22,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:22,394 INFO L93 Difference]: Finished difference Result 231 states and 361 transitions. [2024-11-08 16:04:22,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:04:22,397 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-08 16:04:22,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:22,409 INFO L225 Difference]: With dead ends: 231 [2024-11-08 16:04:22,409 INFO L226 Difference]: Without dead ends: 115 [2024-11-08 16:04:22,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:04:22,420 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:22,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:04:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-08 16:04:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-08 16:04:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 16:04:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2024-11-08 16:04:22,493 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2024-11-08 16:04:22,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:22,494 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2024-11-08 16:04:22,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:04:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2024-11-08 16:04:22,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 16:04:22,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:22,499 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:22,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:04:22,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:22,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:22,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1122413630, now seen corresponding path program 1 times [2024-11-08 16:04:22,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:22,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811209762] [2024-11-08 16:04:22,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:22,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:04:23,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:23,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811209762] [2024-11-08 16:04:23,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811209762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:23,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:23,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:04:23,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677511651] [2024-11-08 16:04:23,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:23,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:04:23,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:23,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:04:23,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:04:23,146 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:23,221 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2024-11-08 16:04:23,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:04:23,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-08 16:04:23,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:23,226 INFO L225 Difference]: With dead ends: 230 [2024-11-08 16:04:23,228 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 16:04:23,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:04:23,230 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:23,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 484 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:04:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 16:04:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-08 16:04:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 16:04:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-11-08 16:04:23,254 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 143 [2024-11-08 16:04:23,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:23,256 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-11-08 16:04:23,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:23,256 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-11-08 16:04:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 16:04:23,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:23,260 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:23,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:04:23,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:23,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash -442355260, now seen corresponding path program 1 times [2024-11-08 16:04:23,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:23,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82780987] [2024-11-08 16:04:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:23,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:04:23,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:23,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82780987] [2024-11-08 16:04:23,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82780987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:23,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:23,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:04:23,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112734653] [2024-11-08 16:04:23,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:23,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:04:23,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:23,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:04:23,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:04:23,690 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:23,750 INFO L93 Difference]: Finished difference Result 234 states and 341 transitions. [2024-11-08 16:04:23,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:04:23,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-08 16:04:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:23,753 INFO L225 Difference]: With dead ends: 234 [2024-11-08 16:04:23,753 INFO L226 Difference]: Without dead ends: 120 [2024-11-08 16:04:23,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:04:23,758 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:23,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 485 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:04:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-08 16:04:23,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-08 16:04:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 16:04:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-11-08 16:04:23,774 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 143 [2024-11-08 16:04:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:23,775 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-11-08 16:04:23,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-11-08 16:04:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 16:04:23,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:23,781 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:23,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:04:23,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:23,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:23,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1332652102, now seen corresponding path program 1 times [2024-11-08 16:04:23,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:23,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837145770] [2024-11-08 16:04:23,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:23,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:04:24,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:24,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837145770] [2024-11-08 16:04:24,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837145770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:24,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:24,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:04:24,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131248074] [2024-11-08 16:04:24,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:24,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:04:24,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:24,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:04:24,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:04:24,112 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:24,150 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2024-11-08 16:04:24,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:04:24,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-08 16:04:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:24,153 INFO L225 Difference]: With dead ends: 238 [2024-11-08 16:04:24,156 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 16:04:24,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:04:24,158 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 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 [2024-11-08 16:04:24,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:04:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 16:04:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-11-08 16:04:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 16:04:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions. [2024-11-08 16:04:24,172 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 143 [2024-11-08 16:04:24,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:24,174 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions. [2024-11-08 16:04:24,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2024-11-08 16:04:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 16:04:24,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:24,177 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:24,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:04:24,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:24,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:24,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1334499144, now seen corresponding path program 1 times [2024-11-08 16:04:24,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:24,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716113899] [2024-11-08 16:04:24,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:24,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:04:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716113899] [2024-11-08 16:04:25,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716113899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:25,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:25,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:04:25,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012379452] [2024-11-08 16:04:25,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:25,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:04:25,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:25,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:04:25,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:04:25,483 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:25,967 INFO L93 Difference]: Finished difference Result 255 states and 365 transitions. [2024-11-08 16:04:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:04:25,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-08 16:04:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:25,970 INFO L225 Difference]: With dead ends: 255 [2024-11-08 16:04:25,970 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 16:04:25,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:04:25,971 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 88 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:25,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 440 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:04:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 16:04:25,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2024-11-08 16:04:25,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 113 states have internal predecessors, (150), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 16:04:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 192 transitions. [2024-11-08 16:04:25,993 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 192 transitions. Word has length 143 [2024-11-08 16:04:25,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:25,993 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 192 transitions. [2024-11-08 16:04:25,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:25,994 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 192 transitions. [2024-11-08 16:04:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:04:25,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:25,995 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:25,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:04:25,996 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:25,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1271195226, now seen corresponding path program 1 times [2024-11-08 16:04:25,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:25,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158836265] [2024-11-08 16:04:25,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:04:26,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:26,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158836265] [2024-11-08 16:04:26,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158836265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:26,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:26,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:04:26,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514969076] [2024-11-08 16:04:26,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:26,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:04:26,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:26,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:04:26,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:04:26,401 INFO L87 Difference]: Start difference. First operand 136 states and 192 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:26,452 INFO L93 Difference]: Finished difference Result 263 states and 372 transitions. [2024-11-08 16:04:26,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:04:26,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-08 16:04:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:26,456 INFO L225 Difference]: With dead ends: 263 [2024-11-08 16:04:26,456 INFO L226 Difference]: Without dead ends: 139 [2024-11-08 16:04:26,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:04:26,460 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:26,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:04:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-08 16:04:26,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-08 16:04:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 116 states have internal predecessors, (153), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 16:04:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 195 transitions. [2024-11-08 16:04:26,478 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 195 transitions. Word has length 145 [2024-11-08 16:04:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:26,480 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 195 transitions. [2024-11-08 16:04:26,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 195 transitions. [2024-11-08 16:04:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:04:26,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:26,483 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:26,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:04:26,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:26,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:26,483 INFO L85 PathProgramCache]: Analyzing trace with hash 20743929, now seen corresponding path program 1 times [2024-11-08 16:04:26,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:26,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828738371] [2024-11-08 16:04:26,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:26,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:04:27,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:27,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828738371] [2024-11-08 16:04:27,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828738371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:27,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:27,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:04:27,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476243290] [2024-11-08 16:04:27,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:27,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:04:27,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:27,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:04:27,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:04:27,748 INFO L87 Difference]: Start difference. First operand 139 states and 195 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:28,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:28,254 INFO L93 Difference]: Finished difference Result 267 states and 375 transitions. [2024-11-08 16:04:28,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:04:28,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-08 16:04:28,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:28,257 INFO L225 Difference]: With dead ends: 267 [2024-11-08 16:04:28,257 INFO L226 Difference]: Without dead ends: 140 [2024-11-08 16:04:28,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:04:28,259 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 83 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:28,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 563 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:04:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-08 16:04:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2024-11-08 16:04:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 114 states have internal predecessors, (150), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 16:04:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2024-11-08 16:04:28,269 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 192 transitions. Word has length 146 [2024-11-08 16:04:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:28,270 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 192 transitions. [2024-11-08 16:04:28,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 192 transitions. [2024-11-08 16:04:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 16:04:28,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:28,272 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:28,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:04:28,272 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:28,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:28,273 INFO L85 PathProgramCache]: Analyzing trace with hash -87967201, now seen corresponding path program 1 times [2024-11-08 16:04:28,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:28,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639379887] [2024-11-08 16:04:28,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:28,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:04:29,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:29,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639379887] [2024-11-08 16:04:29,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639379887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:29,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:29,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:04:29,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048027671] [2024-11-08 16:04:29,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:29,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:04:29,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:29,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:04:29,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:04:29,526 INFO L87 Difference]: Start difference. First operand 137 states and 192 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:30,027 INFO L93 Difference]: Finished difference Result 375 states and 529 transitions. [2024-11-08 16:04:30,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:04:30,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2024-11-08 16:04:30,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:30,030 INFO L225 Difference]: With dead ends: 375 [2024-11-08 16:04:30,030 INFO L226 Difference]: Without dead ends: 250 [2024-11-08 16:04:30,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:04:30,032 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 146 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:30,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 364 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:04:30,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-08 16:04:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 200. [2024-11-08 16:04:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 162 states have internal predecessors, (214), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 16:04:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 282 transitions. [2024-11-08 16:04:30,051 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 282 transitions. Word has length 147 [2024-11-08 16:04:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:30,052 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 282 transitions. [2024-11-08 16:04:30,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:30,053 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 282 transitions. [2024-11-08 16:04:30,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 16:04:30,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:30,055 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:30,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:04:30,055 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:30,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash -883828039, now seen corresponding path program 1 times [2024-11-08 16:04:30,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:30,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003185156] [2024-11-08 16:04:30,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:30,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:04:30,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:30,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003185156] [2024-11-08 16:04:30,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003185156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:30,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:30,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:04:30,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91784412] [2024-11-08 16:04:30,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:30,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:04:30,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:30,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:04:30,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:04:30,672 INFO L87 Difference]: Start difference. First operand 200 states and 282 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:30,936 INFO L93 Difference]: Finished difference Result 365 states and 510 transitions. [2024-11-08 16:04:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:04:30,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-08 16:04:30,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:30,939 INFO L225 Difference]: With dead ends: 365 [2024-11-08 16:04:30,939 INFO L226 Difference]: Without dead ends: 240 [2024-11-08 16:04:30,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:04:30,940 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 86 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:30,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 418 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:04:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-08 16:04:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 204. [2024-11-08 16:04:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 166 states have (on average 1.319277108433735) internal successors, (219), 166 states have internal predecessors, (219), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 16:04:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 287 transitions. [2024-11-08 16:04:30,983 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 287 transitions. Word has length 151 [2024-11-08 16:04:30,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:30,984 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 287 transitions. [2024-11-08 16:04:30,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:30,985 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 287 transitions. [2024-11-08 16:04:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 16:04:30,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:30,987 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:30,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:04:30,987 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:30,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:30,988 INFO L85 PathProgramCache]: Analyzing trace with hash -664973321, now seen corresponding path program 1 times [2024-11-08 16:04:30,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:30,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913680161] [2024-11-08 16:04:30,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:30,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:04:31,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:31,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913680161] [2024-11-08 16:04:31,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913680161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:31,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:31,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:04:31,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894202141] [2024-11-08 16:04:31,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:31,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:04:31,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:31,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:04:31,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:04:31,925 INFO L87 Difference]: Start difference. First operand 204 states and 287 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:32,588 INFO L93 Difference]: Finished difference Result 386 states and 538 transitions. [2024-11-08 16:04:32,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:04:32,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-08 16:04:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:32,590 INFO L225 Difference]: With dead ends: 386 [2024-11-08 16:04:32,590 INFO L226 Difference]: Without dead ends: 257 [2024-11-08 16:04:32,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:04:32,593 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 129 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:32,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 599 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:04:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-08 16:04:32,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 207. [2024-11-08 16:04:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 169 states have (on average 1.3136094674556213) internal successors, (222), 169 states have internal predecessors, (222), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 16:04:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 290 transitions. [2024-11-08 16:04:32,618 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 290 transitions. Word has length 151 [2024-11-08 16:04:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:32,619 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 290 transitions. [2024-11-08 16:04:32,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 290 transitions. [2024-11-08 16:04:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 16:04:32,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:32,621 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:32,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:04:32,622 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:32,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1924037531, now seen corresponding path program 1 times [2024-11-08 16:04:32,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:32,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117037564] [2024-11-08 16:04:32,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:32,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:04:35,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:35,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117037564] [2024-11-08 16:04:35,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117037564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:35,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:35,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:04:35,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132662374] [2024-11-08 16:04:35,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:35,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:04:35,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:35,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:04:35,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:04:35,304 INFO L87 Difference]: Start difference. First operand 207 states and 290 transitions. Second operand has 8 states, 6 states have (on average 11.666666666666666) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-08 16:04:36,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:36,428 INFO L93 Difference]: Finished difference Result 427 states and 589 transitions. [2024-11-08 16:04:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:04:36,429 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.666666666666666) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 152 [2024-11-08 16:04:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:36,434 INFO L225 Difference]: With dead ends: 427 [2024-11-08 16:04:36,434 INFO L226 Difference]: Without dead ends: 298 [2024-11-08 16:04:36,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:04:36,436 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 75 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:36,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 876 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 16:04:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-08 16:04:36,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 295. [2024-11-08 16:04:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 247 states have (on average 1.2995951417004048) internal successors, (321), 248 states have internal predecessors, (321), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:04:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 405 transitions. [2024-11-08 16:04:36,464 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 405 transitions. Word has length 152 [2024-11-08 16:04:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:36,465 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 405 transitions. [2024-11-08 16:04:36,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.666666666666666) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-08 16:04:36,465 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 405 transitions. [2024-11-08 16:04:36,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 16:04:36,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:36,468 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:36,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:04:36,469 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:36,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:36,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2147291882, now seen corresponding path program 1 times [2024-11-08 16:04:36,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:36,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785768509] [2024-11-08 16:04:36,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:36,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:04:36,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:36,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785768509] [2024-11-08 16:04:36,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785768509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:36,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:36,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:04:36,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594520307] [2024-11-08 16:04:36,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:36,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:04:36,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:36,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:04:36,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:04:36,692 INFO L87 Difference]: Start difference. First operand 295 states and 405 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:36,731 INFO L93 Difference]: Finished difference Result 508 states and 699 transitions. [2024-11-08 16:04:36,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:04:36,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2024-11-08 16:04:36,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:36,735 INFO L225 Difference]: With dead ends: 508 [2024-11-08 16:04:36,735 INFO L226 Difference]: Without dead ends: 297 [2024-11-08 16:04:36,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:04:36,737 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:36,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:04:36,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-08 16:04:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-11-08 16:04:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 249 states have (on average 1.2971887550200802) internal successors, (323), 250 states have internal predecessors, (323), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:04:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 407 transitions. [2024-11-08 16:04:36,765 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 407 transitions. Word has length 154 [2024-11-08 16:04:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:36,766 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 407 transitions. [2024-11-08 16:04:36,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:04:36,766 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 407 transitions. [2024-11-08 16:04:36,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 16:04:36,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:36,768 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:36,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:04:36,769 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:36,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:36,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2002095151, now seen corresponding path program 1 times [2024-11-08 16:04:36,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:36,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357488174] [2024-11-08 16:04:36,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:36,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:04:38,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:38,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357488174] [2024-11-08 16:04:38,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357488174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:38,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:38,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:04:38,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162819268] [2024-11-08 16:04:38,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:38,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:04:38,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:38,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:04:38,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:04:38,556 INFO L87 Difference]: Start difference. First operand 297 states and 407 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:04:39,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:39,560 INFO L93 Difference]: Finished difference Result 309 states and 419 transitions. [2024-11-08 16:04:39,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:04:39,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2024-11-08 16:04:39,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:39,563 INFO L225 Difference]: With dead ends: 309 [2024-11-08 16:04:39,563 INFO L226 Difference]: Without dead ends: 307 [2024-11-08 16:04:39,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:04:39,564 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 96 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:39,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 810 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 16:04:39,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-08 16:04:39,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-11-08 16:04:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 258 states have (on average 1.2868217054263567) internal successors, (332), 259 states have internal predecessors, (332), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:04:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 416 transitions. [2024-11-08 16:04:39,604 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 416 transitions. Word has length 154 [2024-11-08 16:04:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:39,605 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 416 transitions. [2024-11-08 16:04:39,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:04:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 416 transitions. [2024-11-08 16:04:39,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 16:04:39,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:39,607 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:39,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:04:39,608 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:39,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:39,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2000248109, now seen corresponding path program 1 times [2024-11-08 16:04:39,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:39,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547317386] [2024-11-08 16:04:39,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:39,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-08 16:04:42,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:42,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547317386] [2024-11-08 16:04:42,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547317386] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:04:42,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717694151] [2024-11-08 16:04:42,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:42,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:04:42,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:04:42,420 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:04:42,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:04:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:43,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 16:04:43,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:04:43,649 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 55 treesize of output 54 [2024-11-08 16:04:43,776 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 0 case distinctions, treesize of input 94 treesize of output 77 [2024-11-08 16:04:44,081 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 0 case distinctions, treesize of input 94 treesize of output 77 [2024-11-08 16:04:44,313 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 0 case distinctions, treesize of input 94 treesize of output 77 [2024-11-08 16:04:44,570 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 0 case distinctions, treesize of input 98 treesize of output 79 [2024-11-08 16:04:44,826 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 0 case distinctions, treesize of input 102 treesize of output 81 [2024-11-08 16:04:45,080 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 0 case distinctions, treesize of input 106 treesize of output 83 [2024-11-08 16:04:45,710 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 0 case distinctions, treesize of input 119 treesize of output 92 [2024-11-08 16:04:46,173 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 0 case distinctions, treesize of input 119 treesize of output 92 [2024-11-08 16:04:46,531 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 0 case distinctions, treesize of input 119 treesize of output 92 [2024-11-08 16:04:47,108 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 0 case distinctions, treesize of input 119 treesize of output 92 [2024-11-08 16:04:47,347 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 124 treesize of output 94 [2024-11-08 16:04:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 28 proven. 439 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-08 16:04:47,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:04:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-08 16:04:48,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717694151] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:04:48,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:04:48,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 9] total 27 [2024-11-08 16:04:48,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969011944] [2024-11-08 16:04:48,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:04:48,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 16:04:48,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:48,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 16:04:48,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2024-11-08 16:04:48,061 INFO L87 Difference]: Start difference. First operand 307 states and 416 transitions. Second operand has 27 states, 23 states have (on average 7.434782608695652) internal successors, (171), 27 states have internal predecessors, (171), 15 states have call successors, (51), 7 states have call predecessors, (51), 10 states have return successors, (51), 11 states have call predecessors, (51), 15 states have call successors, (51) [2024-11-08 16:04:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:53,713 INFO L93 Difference]: Finished difference Result 839 states and 1108 transitions. [2024-11-08 16:04:53,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-08 16:04:53,714 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 7.434782608695652) internal successors, (171), 27 states have internal predecessors, (171), 15 states have call successors, (51), 7 states have call predecessors, (51), 10 states have return successors, (51), 11 states have call predecessors, (51), 15 states have call successors, (51) Word has length 154 [2024-11-08 16:04:53,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:53,717 INFO L225 Difference]: With dead ends: 839 [2024-11-08 16:04:53,717 INFO L226 Difference]: Without dead ends: 597 [2024-11-08 16:04:53,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 328 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=704, Invalid=2266, Unknown=0, NotChecked=0, Total=2970 [2024-11-08 16:04:53,720 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 665 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:53,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 950 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 16:04:53,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-08 16:04:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 573. [2024-11-08 16:04:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 488 states have (on average 1.278688524590164) internal successors, (624), 490 states have internal predecessors, (624), 67 states have call successors, (67), 17 states have call predecessors, (67), 17 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-08 16:04:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 758 transitions. [2024-11-08 16:04:53,778 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 758 transitions. Word has length 154 [2024-11-08 16:04:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:53,778 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 758 transitions. [2024-11-08 16:04:53,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 7.434782608695652) internal successors, (171), 27 states have internal predecessors, (171), 15 states have call successors, (51), 7 states have call predecessors, (51), 10 states have return successors, (51), 11 states have call predecessors, (51), 15 states have call successors, (51) [2024-11-08 16:04:53,779 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 758 transitions. [2024-11-08 16:04:53,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 16:04:53,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:53,781 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:53,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 16:04:53,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 16:04:53,982 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:53,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:53,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2091918408, now seen corresponding path program 1 times [2024-11-08 16:04:53,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:53,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786586655] [2024-11-08 16:04:53,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:53,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:04:56,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:56,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786586655] [2024-11-08 16:04:56,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786586655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:56,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:56,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:04:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722066414] [2024-11-08 16:04:56,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:56,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:04:56,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:56,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:04:56,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:04:56,859 INFO L87 Difference]: Start difference. First operand 573 states and 758 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:04:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:04:57,952 INFO L93 Difference]: Finished difference Result 1027 states and 1365 transitions. [2024-11-08 16:04:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:04:57,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2024-11-08 16:04:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:04:57,956 INFO L225 Difference]: With dead ends: 1027 [2024-11-08 16:04:57,956 INFO L226 Difference]: Without dead ends: 581 [2024-11-08 16:04:57,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:04:57,958 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 162 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:04:57,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 475 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 16:04:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-08 16:04:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 577. [2024-11-08 16:04:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 491 states have (on average 1.2729124236252545) internal successors, (625), 493 states have internal predecessors, (625), 67 states have call successors, (67), 18 states have call predecessors, (67), 18 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-08 16:04:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 759 transitions. [2024-11-08 16:04:58,020 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 759 transitions. Word has length 156 [2024-11-08 16:04:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:04:58,020 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 759 transitions. [2024-11-08 16:04:58,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:04:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 759 transitions. [2024-11-08 16:04:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 16:04:58,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:04:58,024 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:04:58,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 16:04:58,025 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:04:58,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:04:58,025 INFO L85 PathProgramCache]: Analyzing trace with hash -963820709, now seen corresponding path program 1 times [2024-11-08 16:04:58,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:04:58,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001158624] [2024-11-08 16:04:58,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:04:58,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:04:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:04:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:04:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:04:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:04:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:04:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:04:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:04:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:04:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:04:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:04:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:04:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:04:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:04:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:04:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:04:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:04:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:04:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:04:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:04:59,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:04:59,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001158624] [2024-11-08 16:04:59,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001158624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:04:59,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:04:59,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:04:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749304988] [2024-11-08 16:04:59,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:04:59,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:04:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:04:59,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:04:59,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:04:59,968 INFO L87 Difference]: Start difference. First operand 577 states and 759 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:05:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:05:00,508 INFO L93 Difference]: Finished difference Result 1344 states and 1780 transitions. [2024-11-08 16:05:00,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:05:00,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2024-11-08 16:05:00,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:05:00,516 INFO L225 Difference]: With dead ends: 1344 [2024-11-08 16:05:00,516 INFO L226 Difference]: Without dead ends: 894 [2024-11-08 16:05:00,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:05:00,518 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 66 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:05:00,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 510 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:05:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-11-08 16:05:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 686. [2024-11-08 16:05:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 600 states have (on average 1.2866666666666666) internal successors, (772), 602 states have internal predecessors, (772), 67 states have call successors, (67), 18 states have call predecessors, (67), 18 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-08 16:05:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 906 transitions. [2024-11-08 16:05:00,587 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 906 transitions. Word has length 156 [2024-11-08 16:05:00,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:05:00,587 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 906 transitions. [2024-11-08 16:05:00,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:05:00,588 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 906 transitions. [2024-11-08 16:05:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 16:05:00,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:05:00,590 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:05:00,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 16:05:00,590 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:05:00,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:05:00,591 INFO L85 PathProgramCache]: Analyzing trace with hash -516154651, now seen corresponding path program 1 times [2024-11-08 16:05:00,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:05:00,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218685677] [2024-11-08 16:05:00,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:05:00,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:05:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:05:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:05:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:05:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:05:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:05:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:05:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:05:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:05:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:05:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:05:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:05:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:05:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:05:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:05:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:05:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:05:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:05:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:05:00,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:05:00,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218685677] [2024-11-08 16:05:00,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218685677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:05:00,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:05:00,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:05:00,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948114565] [2024-11-08 16:05:00,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:05:00,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:05:00,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:05:00,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:05:00,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:05:00,740 INFO L87 Difference]: Start difference. First operand 686 states and 906 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:05:00,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:05:00,805 INFO L93 Difference]: Finished difference Result 1234 states and 1641 transitions. [2024-11-08 16:05:00,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:05:00,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2024-11-08 16:05:00,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:05:00,809 INFO L225 Difference]: With dead ends: 1234 [2024-11-08 16:05:00,810 INFO L226 Difference]: Without dead ends: 694 [2024-11-08 16:05:00,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:05:00,812 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:05:00,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:05:00,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-08 16:05:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2024-11-08 16:05:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 608 states have (on average 1.2828947368421053) internal successors, (780), 610 states have internal predecessors, (780), 67 states have call successors, (67), 18 states have call predecessors, (67), 18 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-08 16:05:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 914 transitions. [2024-11-08 16:05:00,869 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 914 transitions. Word has length 156 [2024-11-08 16:05:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:05:00,870 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 914 transitions. [2024-11-08 16:05:00,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:05:00,870 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 914 transitions. [2024-11-08 16:05:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 16:05:00,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:05:00,872 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:05:00,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 16:05:00,872 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:05:00,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:05:00,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1570389304, now seen corresponding path program 1 times [2024-11-08 16:05:00,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:05:00,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811515828] [2024-11-08 16:05:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:05:00,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:05:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:05:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:05:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:05:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:05:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:05:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:05:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:05:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:05:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:05:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:05:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:05:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:05:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:05:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:05:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:05:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:05:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:05:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:05:02,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:05:02,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811515828] [2024-11-08 16:05:02,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811515828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:05:02,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:05:02,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:05:02,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917078072] [2024-11-08 16:05:02,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:05:02,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:05:02,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:05:02,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:05:02,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:05:02,397 INFO L87 Difference]: Start difference. First operand 694 states and 914 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:05:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:05:02,963 INFO L93 Difference]: Finished difference Result 1155 states and 1518 transitions. [2024-11-08 16:05:02,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:05:02,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2024-11-08 16:05:02,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:05:02,969 INFO L225 Difference]: With dead ends: 1155 [2024-11-08 16:05:02,969 INFO L226 Difference]: Without dead ends: 874 [2024-11-08 16:05:02,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:05:02,972 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 148 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:05:02,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 483 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:05:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-08 16:05:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 666. [2024-11-08 16:05:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 580 states have (on average 1.2775862068965518) internal successors, (741), 582 states have internal predecessors, (741), 67 states have call successors, (67), 18 states have call predecessors, (67), 18 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-08 16:05:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 875 transitions. [2024-11-08 16:05:03,034 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 875 transitions. Word has length 156 [2024-11-08 16:05:03,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:05:03,034 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 875 transitions. [2024-11-08 16:05:03,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:05:03,035 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 875 transitions. [2024-11-08 16:05:03,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 16:05:03,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:05:03,036 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:05:03,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 16:05:03,037 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:05:03,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:05:03,037 INFO L85 PathProgramCache]: Analyzing trace with hash -540173987, now seen corresponding path program 1 times [2024-11-08 16:05:03,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:05:03,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626829920] [2024-11-08 16:05:03,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:05:03,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:05:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:05:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:05:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:05:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:05:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:05:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:05:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:05:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:05:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:05:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:05:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:05:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:05:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:05:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:05:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:05:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:05:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:05:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:05:03,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:05:03,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626829920] [2024-11-08 16:05:03,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626829920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:05:03,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:05:03,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:05:03,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789640751] [2024-11-08 16:05:03,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:05:03,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:05:03,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:05:03,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:05:03,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:05:03,686 INFO L87 Difference]: Start difference. First operand 666 states and 875 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:05:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:05:04,254 INFO L93 Difference]: Finished difference Result 1448 states and 1909 transitions. [2024-11-08 16:05:04,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:05:04,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2024-11-08 16:05:04,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:05:04,259 INFO L225 Difference]: With dead ends: 1448 [2024-11-08 16:05:04,260 INFO L226 Difference]: Without dead ends: 883 [2024-11-08 16:05:04,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:05:04,262 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 140 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:05:04,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 570 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:05:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-08 16:05:04,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 665. [2024-11-08 16:05:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 579 states have (on average 1.2746113989637307) internal successors, (738), 581 states have internal predecessors, (738), 67 states have call successors, (67), 18 states have call predecessors, (67), 18 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-08 16:05:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 872 transitions. [2024-11-08 16:05:04,318 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 872 transitions. Word has length 156 [2024-11-08 16:05:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:05:04,319 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 872 transitions. [2024-11-08 16:05:04,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:05:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 872 transitions. [2024-11-08 16:05:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 16:05:04,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:05:04,322 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:05:04,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 16:05:04,323 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:05:04,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:05:04,323 INFO L85 PathProgramCache]: Analyzing trace with hash -141012854, now seen corresponding path program 1 times [2024-11-08 16:05:04,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:05:04,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184758110] [2024-11-08 16:05:04,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:05:04,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:05:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:05:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:05:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:05:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:05:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:05:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:05:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:05:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:05:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:05:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:05:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:05:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:05:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:05:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:05:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 16:05:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:05:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 16:05:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:05:05,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:05:05,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184758110] [2024-11-08 16:05:05,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184758110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:05:05,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:05:05,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:05:05,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839151388] [2024-11-08 16:05:05,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:05:05,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:05:05,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:05:05,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:05:05,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:05:05,955 INFO L87 Difference]: Start difference. First operand 665 states and 872 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:05:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:05:06,937 INFO L93 Difference]: Finished difference Result 1461 states and 1922 transitions. [2024-11-08 16:05:06,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:05:06,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 158 [2024-11-08 16:05:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:05:06,943 INFO L225 Difference]: With dead ends: 1461 [2024-11-08 16:05:06,943 INFO L226 Difference]: Without dead ends: 951 [2024-11-08 16:05:06,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:05:06,946 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 184 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:05:06,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 664 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 16:05:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-11-08 16:05:07,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 888. [2024-11-08 16:05:07,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 771 states have (on average 1.25810635538262) internal successors, (970), 775 states have internal predecessors, (970), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (92), 88 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-08 16:05:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1154 transitions. [2024-11-08 16:05:07,021 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1154 transitions. Word has length 158 [2024-11-08 16:05:07,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:05:07,022 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1154 transitions. [2024-11-08 16:05:07,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:05:07,023 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1154 transitions. [2024-11-08 16:05:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 16:05:07,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:05:07,025 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:05:07,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 16:05:07,026 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:05:07,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:05:07,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1094219875, now seen corresponding path program 1 times [2024-11-08 16:05:07,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:05:07,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807719655] [2024-11-08 16:05:07,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:05:07,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:05:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:05:07,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:05:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:05:07,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:05:07,478 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:05:07,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:05:07,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 16:05:07,487 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:05:07,598 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:05:07,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:05:07 BoogieIcfgContainer [2024-11-08 16:05:07,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:05:07,605 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:05:07,605 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:05:07,605 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:05:07,606 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:04:21" (3/4) ... [2024-11-08 16:05:07,609 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:05:07,610 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:05:07,611 INFO L158 Benchmark]: Toolchain (without parser) took 48057.11ms. Allocated memory was 144.7MB in the beginning and 677.4MB in the end (delta: 532.7MB). Free memory was 101.0MB in the beginning and 262.9MB in the end (delta: -161.9MB). Peak memory consumption was 372.2MB. Max. memory is 16.1GB. [2024-11-08 16:05:07,611 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 109.1MB. Free memory was 83.8MB in the beginning and 83.7MB in the end (delta: 23.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:05:07,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.81ms. Allocated memory is still 144.7MB. Free memory was 101.0MB in the beginning and 82.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 16:05:07,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.38ms. Allocated memory is still 144.7MB. Free memory was 82.1MB in the beginning and 78.4MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:05:07,613 INFO L158 Benchmark]: Boogie Preprocessor took 94.91ms. Allocated memory is still 144.7MB. Free memory was 78.0MB in the beginning and 112.7MB in the end (delta: -34.7MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-11-08 16:05:07,613 INFO L158 Benchmark]: RCFGBuilder took 1199.38ms. Allocated memory is still 144.7MB. Free memory was 112.7MB in the beginning and 76.3MB in the end (delta: 36.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-08 16:05:07,614 INFO L158 Benchmark]: TraceAbstraction took 46196.18ms. Allocated memory was 144.7MB in the beginning and 677.4MB in the end (delta: 532.7MB). Free memory was 75.5MB in the beginning and 262.9MB in the end (delta: -187.4MB). Peak memory consumption was 345.7MB. Max. memory is 16.1GB. [2024-11-08 16:05:07,614 INFO L158 Benchmark]: Witness Printer took 5.94ms. Allocated memory is still 677.4MB. Free memory is still 262.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:05:07,616 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 109.1MB. Free memory was 83.8MB in the beginning and 83.7MB in the end (delta: 23.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.81ms. Allocated memory is still 144.7MB. Free memory was 101.0MB in the beginning and 82.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.38ms. Allocated memory is still 144.7MB. Free memory was 82.1MB in the beginning and 78.4MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.91ms. Allocated memory is still 144.7MB. Free memory was 78.0MB in the beginning and 112.7MB in the end (delta: -34.7MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1199.38ms. Allocated memory is still 144.7MB. Free memory was 112.7MB in the beginning and 76.3MB in the end (delta: 36.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 46196.18ms. Allocated memory was 144.7MB in the beginning and 677.4MB in the end (delta: 532.7MB). Free memory was 75.5MB in the beginning and 262.9MB in the end (delta: -187.4MB). Peak memory consumption was 345.7MB. Max. memory is 16.1GB. * Witness Printer took 5.94ms. Allocated memory is still 677.4MB. Free memory is still 262.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of bitwiseOr at line 124. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -8, 0, 1, -1, -50, 100, 25, 2568920345, 1191097264, 1801344522, 64, -16, 1000000.5, 4.5, 0, 128 }; [L59] unsigned long int last_1_WrapperStruct00_var_1_10 = 25; [L60] signed short int last_1_WrapperStruct00_var_1_15 = -16; [L61] unsigned char last_1_WrapperStruct00_var_1_18 = 0; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L119] EXPR WrapperStruct00.var_1_10 [L119] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_15 [L120] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L121] EXPR WrapperStruct00.var_1_18 [L121] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L91] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L93] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L94] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L97] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L99] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L100] WrapperStruct00.var_1_9 = __VERIFIER_nondet_char() [L101] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L103] WrapperStruct00.var_1_11 = __VERIFIER_nondet_ulong() [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L106] WrapperStruct00.var_1_12 = __VERIFIER_nondet_ulong() [L107] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L108] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L109] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L110] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L111] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L112] WrapperStruct00.var_1_17 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_17 [L113] EXPR WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_17 [L113] EXPR WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L113] EXPR (WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_17 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L114] WrapperStruct00.var_1_19 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L116] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L132] RET updateVariables() [L133] CALL step() [L65] EXPR last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L65] ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 [L65] EXPR WrapperStruct00.var_1_5 [L65] ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L65] COND FALSE !(((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) [L72] EXPR WrapperStruct00.var_1_7 [L72] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_7 [L74] WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L74] COND FALSE !(WrapperStruct00.var_1_5) [L77] EXPR WrapperStruct00.var_1_12 [L77] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L77] COND TRUE WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8 [L78] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L78] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) [L78] EXPR WrapperStruct00.var_1_8 [L78] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L78] WrapperStruct00.var_1_14 = ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) [L80] WrapperStruct00.var_1_15 = 2 [L81] EXPR WrapperStruct00.var_1_17 [L81] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_17 [L82] EXPR WrapperStruct00.var_1_19 [L82] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L83] EXPR WrapperStruct00.var_1_8 [L83] EXPR WrapperStruct00.var_1_1 [L83] unsigned char stepLocal_0 = WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1; [L84] stepLocal_0 && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L84] COND FALSE !(stepLocal_0 && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) [L87] EXPR WrapperStruct00.var_1_11 [L87] EXPR WrapperStruct00.var_1_13 [L87] WrapperStruct00.var_1_10 = (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13) [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 [L124] EXPR WrapperStruct00.var_1_5 [L124] EXPR ((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) [L124] EXPR WrapperStruct00.var_1_1 [L124] EXPR WrapperStruct00.var_1_7 [L124] EXPR (((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1) [L124] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13)))) [L124] EXPR WrapperStruct00.var_1_8 [L124] EXPR WrapperStruct00.var_1_1 [L124] EXPR (WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))) [L124] EXPR WrapperStruct00.var_1_10 [L124] EXPR WrapperStruct00.var_1_11 [L124] EXPR WrapperStruct00.var_1_13 [L124] EXPR ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1) [L124] EXPR WrapperStruct00.var_1_12 [L124] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1 [L124] EXPR WrapperStruct00.var_1_14 [L124] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) [L124] EXPR WrapperStruct00.var_1_8 [L124] EXPR ((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2)) [L124] EXPR WrapperStruct00.var_1_15 [L124] EXPR (((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR ((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17)) [L124] EXPR WrapperStruct00.var_1_16 [L124] EXPR WrapperStruct00.var_1_17 [L124] EXPR ((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124] EXPR (((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned char) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L124-L125] return (((((((((last_1_WrapperStruct00_var_1_15 | last_1_WrapperStruct00_var_1_10) > last_1_WrapperStruct00_var_1_18) && WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((signed char) ((((WrapperStruct00.var_1_7) > (WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_9))))) : 1)) && (((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_1) && (((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_8))) == WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))) - 1u)))) : (WrapperStruct00.var_1_10 == ((unsigned long int) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_14 == ((signed long int) ((((WrapperStruct00.var_1_8) < 0 ) ? -(WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))))) : 1)) && (WrapperStruct00.var_1_15 == ((signed short int) 2))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned char) WrapperStruct00.var_1_19)) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=25, last_1_WrapperStruct00_var_1_15=-16, last_1_WrapperStruct00_var_1_18=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.0s, OverallIterations: 21, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2081 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2071 mSDsluCounter, 10638 SdHoareTripleChecker+Invalid, 10.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7720 mSDsCounter, 580 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5357 IncrementalHoareTripleChecker+Invalid, 5937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 580 mSolverCounterUnsat, 2918 mSDtfsCounter, 5357 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1242 GetRequests, 1098 SyntacticMatches, 5 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=888occurred in iteration=20, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 871 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 26.0s InterpolantComputationTime, 3319 NumberOfCodeBlocks, 3319 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3293 ConstructedInterpolants, 0 QuantifiedInterpolants, 21166 SizeOfPredicates, 4 NumberOfNonLiveVariables, 558 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 11499/11968 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 16:05:07,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:05:10,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:05:10,286 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:05:10,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:05:10,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:05:10,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:05:10,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:05:10,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:05:10,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:05:10,347 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:05:10,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:05:10,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:05:10,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:05:10,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:05:10,350 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:05:10,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:05:10,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:05:10,351 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:05:10,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:05:10,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:05:10,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:05:10,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:05:10,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:05:10,353 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:05:10,353 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:05:10,354 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:05:10,354 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:05:10,354 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:05:10,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:05:10,355 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:05:10,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:05:10,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:05:10,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:05:10,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:05:10,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:05:10,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:05:10,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:05:10,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:05:10,358 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:05:10,358 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:05:10,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:05:10,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:05:10,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:05:10,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:05:10,360 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_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ed30b990283645eacfcf3ec95d058dabc11775aacfdc34a24bd9c1336ca33bd [2024-11-08 16:05:10,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:05:10,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:05:10,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:05:10,800 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:05:10,801 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:05:10,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i Unable to find full path for "g++" [2024-11-08 16:05:12,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:05:13,227 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:05:13,229 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i [2024-11-08 16:05:13,241 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/data/cd1653fa1/f1b70de2c284439681ad1e5d7c1c5db7/FLAG823396f9b [2024-11-08 16:05:13,265 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/data/cd1653fa1/f1b70de2c284439681ad1e5d7c1c5db7 [2024-11-08 16:05:13,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:05:13,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:05:13,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:05:13,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:05:13,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:05:13,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:05:13" (1/1) ... [2024-11-08 16:05:13,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c5075e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:13, skipping insertion in model container [2024-11-08 16:05:13,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:05:13" (1/1) ... [2024-11-08 16:05:13,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:05:13,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i[916,929] [2024-11-08 16:05:13,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:05:13,708 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:05:13,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-88.i[916,929] [2024-11-08 16:05:13,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:05:13,830 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:05:13,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:13 WrapperNode [2024-11-08 16:05:13,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:05:13,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:05:13,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:05:13,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:05:13,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:13" (1/1) ... [2024-11-08 16:05:13,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:13" (1/1) ... [2024-11-08 16:05:13,922 INFO L138 Inliner]: procedures = 37, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 499 [2024-11-08 16:05:13,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:05:13,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:05:13,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:05:13,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:05:13,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:13" (1/1) ... [2024-11-08 16:05:13,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:13" (1/1) ... [2024-11-08 16:05:13,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:13" (1/1) ... [2024-11-08 16:05:13,977 INFO L175 MemorySlicer]: Split 135 memory accesses to 2 slices as follows [2, 133]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 36 writes are split as follows [0, 36]. [2024-11-08 16:05:13,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:13" (1/1) ... [2024-11-08 16:05:13,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:13" (1/1) ... [2024-11-08 16:05:14,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:13" (1/1) ... [2024-11-08 16:05:14,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:13" (1/1) ... [2024-11-08 16:05:14,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:13" (1/1) ... [2024-11-08 16:05:14,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:13" (1/1) ... [2024-11-08 16:05:14,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:05:14,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:05:14,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:05:14,026 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:05:14,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:13" (1/1) ... [2024-11-08 16:05:14,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:05:14,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:05:14,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:05:14,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:05:14,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:05:14,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 16:05:14,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 16:05:14,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:05:14,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:05:14,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 16:05:14,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 16:05:14,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 16:05:14,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 16:05:14,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 16:05:14,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 16:05:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-08 16:05:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-08 16:05:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 16:05:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 16:05:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-08 16:05:14,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-08 16:05:14,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 16:05:14,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 16:05:14,121 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:05:14,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:05:14,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-08 16:05:14,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-08 16:05:14,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:05:14,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:05:14,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 16:05:14,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 16:05:14,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 16:05:14,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 16:05:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 16:05:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 16:05:14,316 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:05:14,319 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:05:15,168 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-08 16:05:15,168 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:05:15,190 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:05:15,192 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:05:15,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:05:15 BoogieIcfgContainer [2024-11-08 16:05:15,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:05:15,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:05:15,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:05:15,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:05:15,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:05:13" (1/3) ... [2024-11-08 16:05:15,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e317eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:05:15, skipping insertion in model container [2024-11-08 16:05:15,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:05:13" (2/3) ... [2024-11-08 16:05:15,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e317eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:05:15, skipping insertion in model container [2024-11-08 16:05:15,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:05:15" (3/3) ... [2024-11-08 16:05:15,203 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-88.i [2024-11-08 16:05:15,224 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:05:15,224 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:05:15,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:05:15,329 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7966d3b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:05:15,330 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:05:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 16:05:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 16:05:15,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:05:15,359 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:05:15,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:05:15,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:05:15,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1773358306, now seen corresponding path program 1 times [2024-11-08 16:05:15,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:05:15,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590990653] [2024-11-08 16:05:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:05:15,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:05:15,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:05:15,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:05:15,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 16:05:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:15,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:05:15,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:05:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-08 16:05:15,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:05:15,823 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:05:15,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590990653] [2024-11-08 16:05:15,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590990653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:05:15,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:05:15,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:05:15,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237724926] [2024-11-08 16:05:15,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:05:15,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:05:15,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:05:15,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:05:15,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:05:15,872 INFO L87 Difference]: Start difference. First operand has 111 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:05:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:05:15,921 INFO L93 Difference]: Finished difference Result 215 states and 337 transitions. [2024-11-08 16:05:15,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:05:15,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2024-11-08 16:05:15,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:05:15,954 INFO L225 Difference]: With dead ends: 215 [2024-11-08 16:05:15,955 INFO L226 Difference]: Without dead ends: 107 [2024-11-08 16:05:15,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:05:15,975 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:05:15,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:05:16,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-08 16:05:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-08 16:05:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 16:05:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2024-11-08 16:05:16,109 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 139 [2024-11-08 16:05:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:05:16,113 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2024-11-08 16:05:16,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 16:05:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2024-11-08 16:05:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 16:05:16,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:05:16,123 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:05:16,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 16:05:16,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:05:16,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:05:16,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:05:16,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2119359924, now seen corresponding path program 1 times [2024-11-08 16:05:16,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:05:16,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532817954] [2024-11-08 16:05:16,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:05:16,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:05:16,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:05:16,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:05:16,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 16:05:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:16,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 16:05:16,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:05:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:05:16,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:05:16,719 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:05:16,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532817954] [2024-11-08 16:05:16,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532817954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:05:16,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:05:16,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:05:16,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618725002] [2024-11-08 16:05:16,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:05:16,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:05:16,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:05:16,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:05:16,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:05:16,724 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:05:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:05:16,841 INFO L93 Difference]: Finished difference Result 218 states and 319 transitions. [2024-11-08 16:05:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:05:16,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-11-08 16:05:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:05:16,844 INFO L225 Difference]: With dead ends: 218 [2024-11-08 16:05:16,844 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 16:05:16,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:05:16,846 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:05:16,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:05:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 16:05:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-08 16:05:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 16:05:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2024-11-08 16:05:16,875 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 139 [2024-11-08 16:05:16,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:05:16,881 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2024-11-08 16:05:16,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:05:16,882 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2024-11-08 16:05:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 16:05:16,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:05:16,889 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:05:16,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 16:05:17,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:05:17,091 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:05:17,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:05:17,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1439301554, now seen corresponding path program 1 times [2024-11-08 16:05:17,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:05:17,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765692526] [2024-11-08 16:05:17,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:05:17,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:05:17,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:05:17,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:05:17,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 16:05:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:17,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 16:05:17,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:05:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:05:17,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:05:17,537 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:05:17,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765692526] [2024-11-08 16:05:17,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765692526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:05:17,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:05:17,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:05:17,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971823716] [2024-11-08 16:05:17,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:05:17,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:05:17,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:05:17,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:05:17,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:05:17,546 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:05:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:05:17,694 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2024-11-08 16:05:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:05:17,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-11-08 16:05:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:05:17,705 INFO L225 Difference]: With dead ends: 228 [2024-11-08 16:05:17,709 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 16:05:17,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:05:17,711 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:05:17,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 992 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:05:17,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 16:05:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-08 16:05:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 16:05:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-11-08 16:05:17,728 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 139 [2024-11-08 16:05:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:05:17,729 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-11-08 16:05:17,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:05:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-11-08 16:05:17,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 16:05:17,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:05:17,732 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:05:17,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 16:05:17,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:05:17,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:05:17,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:05:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1437454512, now seen corresponding path program 1 times [2024-11-08 16:05:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:05:17,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108682268] [2024-11-08 16:05:17,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:05:17,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:05:17,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:05:17,945 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:05:17,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 16:05:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:05:18,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 16:05:18,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:05:18,353 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 89 treesize of output 88 [2024-11-08 16:05:18,682 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 0 case distinctions, treesize of input 167 treesize of output 140 [2024-11-08 16:05:19,469 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 0 case distinctions, treesize of input 172 treesize of output 145 [2024-11-08 16:05:20,339 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 0 case distinctions, treesize of input 167 treesize of output 140 [2024-11-08 16:05:21,331 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 0 case distinctions, treesize of input 167 treesize of output 140 [2024-11-08 16:05:22,412 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 0 case distinctions, treesize of input 167 treesize of output 142 [2024-11-08 16:05:27,986 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 0 case distinctions, treesize of input 167 treesize of output 142 [2024-11-08 16:05:34,412 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 0 case distinctions, treesize of input 176 treesize of output 149 [2024-11-08 16:05:38,475 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 0 case distinctions, treesize of input 176 treesize of output 149 [2024-11-08 16:05:41,688 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 0 case distinctions, treesize of input 176 treesize of output 149 [2024-11-08 16:05:44,205 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 0 case distinctions, treesize of input 181 treesize of output 150 [2024-11-08 16:05:49,310 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 180 treesize of output 152 [2024-11-08 16:05:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 150 proven. 305 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-08 16:05:49,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:05:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-08 16:05:51,469 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:05:51,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108682268] [2024-11-08 16:05:51,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108682268] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:05:51,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:05:51,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2024-11-08 16:05:51,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168872410] [2024-11-08 16:05:51,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:05:51,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 16:05:51,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:05:51,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 16:05:51,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=286, Unknown=1, NotChecked=0, Total=380 [2024-11-08 16:05:51,474 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 20 states, 18 states have (on average 6.111111111111111) internal successors, (110), 20 states have internal predecessors, (110), 10 states have call successors, (34), 6 states have call predecessors, (34), 8 states have return successors, (34), 8 states have call predecessors, (34), 10 states have call successors, (34) [2024-11-08 16:05:58,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:02,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:05,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:07,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:09,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:13,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:23,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:33,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:43,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:47,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:52,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:06:56,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:00,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:10,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:14,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:19,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:23,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:27,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:31,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:33,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:35,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:41,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:43,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:46,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:48,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:53,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:54,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:57,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:07:58,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:00,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:04,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:08,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:13,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:16,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:20,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:22,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:26,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:32,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:39,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:43,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:47,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:52,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:56,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:08:59,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:09:03,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:09:07,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:09:09,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:09:14,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:09:18,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:09:21,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:09:26,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:09:30,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:09:34,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:09:39,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:09:44,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:09:48,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:09:53,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:09:56,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:00,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:05,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:08,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:09,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:11,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:14,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:18,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:23,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:27,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:29,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:33,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:38,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:40,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:44,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:48,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:53,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:10:57,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:11:02,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:11:03,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:11:05,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:11:28,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:11:32,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:11:34,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:11:38,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:11:42,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:11:47,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:11:52,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:11:57,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:12:01,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:12:05,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:12:07,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:12:11,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:12:15,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:12:19,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:12:23,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:12:28,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:12:33,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:12:37,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:12:41,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:12:46,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:12:49,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:12:55,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:12:56,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:13:01,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:13:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:13:21,930 INFO L93 Difference]: Finished difference Result 435 states and 602 transitions. [2024-11-08 16:13:21,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-08 16:13:21,934 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.111111111111111) internal successors, (110), 20 states have internal predecessors, (110), 10 states have call successors, (34), 6 states have call predecessors, (34), 8 states have return successors, (34), 8 states have call predecessors, (34), 10 states have call successors, (34) Word has length 139 [2024-11-08 16:13:21,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:13:21,943 INFO L225 Difference]: With dead ends: 435 [2024-11-08 16:13:21,946 INFO L226 Difference]: Without dead ends: 321 [2024-11-08 16:13:21,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 258 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 82.8s TimeCoverageRelationStatistics Valid=439, Invalid=1113, Unknown=8, NotChecked=0, Total=1560 [2024-11-08 16:13:21,949 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 260 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 122 mSolverCounterUnsat, 60 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 386.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 60 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 393.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:13:21,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 667 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1309 Invalid, 60 Unknown, 0 Unchecked, 393.4s Time] [2024-11-08 16:13:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-08 16:13:22,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 299. [2024-11-08 16:13:22,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 237 states have (on average 1.2911392405063291) internal successors, (306), 238 states have internal predecessors, (306), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 16:13:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 408 transitions. [2024-11-08 16:13:22,026 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 408 transitions. Word has length 139 [2024-11-08 16:13:22,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:13:22,027 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 408 transitions. [2024-11-08 16:13:22,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.111111111111111) internal successors, (110), 20 states have internal predecessors, (110), 10 states have call successors, (34), 6 states have call predecessors, (34), 8 states have return successors, (34), 8 states have call predecessors, (34), 10 states have call successors, (34) [2024-11-08 16:13:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 408 transitions. [2024-11-08 16:13:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 16:13:22,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:22,032 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:22,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 16:13:22,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:13:22,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:22,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:22,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2060702123, now seen corresponding path program 1 times [2024-11-08 16:13:22,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:13:22,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454479520] [2024-11-08 16:13:22,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:22,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:13:22,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:13:22,236 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:13:22,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 16:13:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:22,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 16:13:22,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:13:22,745 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 91 treesize of output 90 [2024-11-08 16:13:23,479 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 0 case distinctions, treesize of input 150 treesize of output 131 [2024-11-08 16:13:25,175 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 0 case distinctions, treesize of input 155 treesize of output 134 [2024-11-08 16:13:26,766 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 0 case distinctions, treesize of input 160 treesize of output 137 [2024-11-08 16:13:28,427 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 0 case distinctions, treesize of input 160 treesize of output 135 [2024-11-08 16:13:30,319 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 0 case distinctions, treesize of input 165 treesize of output 140 [2024-11-08 16:13:32,552 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 0 case distinctions, treesize of input 171 treesize of output 144 [2024-11-08 16:13:35,015 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 0 case distinctions, treesize of input 171 treesize of output 144 [2024-11-08 16:13:37,347 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 0 case distinctions, treesize of input 171 treesize of output 144 [2024-11-08 16:13:39,209 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 0 case distinctions, treesize of input 171 treesize of output 144 [2024-11-08 16:13:41,571 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 0 case distinctions, treesize of input 171 treesize of output 142 [2024-11-08 16:13:43,029 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 0 case distinctions, treesize of input 175 treesize of output 148 [2024-11-08 16:13:44,202 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 0 case distinctions, treesize of input 205 treesize of output 174 [2024-11-08 16:13:47,186 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 0 case distinctions, treesize of input 206 treesize of output 171 [2024-11-08 16:13:49,134 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 236 treesize of output 196 [2024-11-08 16:13:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 384 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-08 16:13:50,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:13:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:13:54,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:13:54,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454479520] [2024-11-08 16:13:54,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454479520] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:13:54,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:13:54,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2024-11-08 16:13:54,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518243802] [2024-11-08 16:13:54,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:13:54,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:13:54,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:13:54,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:13:54,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:13:54,294 INFO L87 Difference]: Start difference. First operand 299 states and 408 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:13:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:13:59,678 INFO L93 Difference]: Finished difference Result 539 states and 744 transitions. [2024-11-08 16:13:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:13:59,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-11-08 16:13:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:13:59,686 INFO L225 Difference]: With dead ends: 539 [2024-11-08 16:13:59,686 INFO L226 Difference]: Without dead ends: 311 [2024-11-08 16:13:59,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 259 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-11-08 16:13:59,688 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 104 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:13:59,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 449 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-08 16:13:59,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-08 16:13:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-11-08 16:13:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 247 states have (on average 1.2793522267206479) internal successors, (316), 248 states have internal predecessors, (316), 51 states have call successors, (51), 12 states have call predecessors, (51), 12 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 16:13:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 418 transitions. [2024-11-08 16:13:59,785 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 418 transitions. Word has length 141 [2024-11-08 16:13:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:13:59,786 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 418 transitions. [2024-11-08 16:13:59,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:13:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 418 transitions. [2024-11-08 16:13:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 16:13:59,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:59,790 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:59,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 16:13:59,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:13:59,995 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:59,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash -927411779, now seen corresponding path program 1 times [2024-11-08 16:13:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:13:59,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80352796] [2024-11-08 16:13:59,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:59,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:13:59,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:14:00,001 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:14:00,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 16:14:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:00,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:14:00,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:14:00,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:14:00,789 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:14:00,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80352796] [2024-11-08 16:14:00,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80352796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:14:00,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:14:00,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:14:00,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394083793] [2024-11-08 16:14:00,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:14:00,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:14:00,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:14:00,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:14:00,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:14:00,793 INFO L87 Difference]: Start difference. First operand 311 states and 418 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:14:01,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:14:01,297 INFO L93 Difference]: Finished difference Result 557 states and 760 transitions. [2024-11-08 16:14:01,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:14:01,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-11-08 16:14:01,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:14:01,302 INFO L225 Difference]: With dead ends: 557 [2024-11-08 16:14:01,302 INFO L226 Difference]: Without dead ends: 317 [2024-11-08 16:14:01,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:14:01,304 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:14:01,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:14:01,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-08 16:14:01,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-11-08 16:14:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 253 states have (on average 1.2727272727272727) internal successors, (322), 254 states have internal predecessors, (322), 51 states have call successors, (51), 12 states have call predecessors, (51), 12 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 16:14:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 424 transitions. [2024-11-08 16:14:01,382 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 424 transitions. Word has length 143 [2024-11-08 16:14:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:14:01,383 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 424 transitions. [2024-11-08 16:14:01,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:14:01,383 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 424 transitions. [2024-11-08 16:14:01,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 16:14:01,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:14:01,386 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:14:01,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 16:14:01,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:01,588 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:14:01,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:14:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash 583403492, now seen corresponding path program 1 times [2024-11-08 16:14:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:14:01,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453020495] [2024-11-08 16:14:01,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:14:01,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:01,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:14:01,594 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:14:01,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 16:14:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:01,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 16:14:01,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:02,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 16:14:02,616 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 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-08 16:14:03,133 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 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-08 16:14:04,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:04,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-08 16:14:04,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:04,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-08 16:14:05,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:05,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-08 16:14:06,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:06,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-08 16:14:07,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:07,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-08 16:14:08,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:08,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-08 16:14:09,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:09,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 40 treesize of output 36 [2024-11-08 16:14:10,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:10,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 39 [2024-11-08 16:14:10,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:10,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 39 [2024-11-08 16:14:11,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:11,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 39 [2024-11-08 16:14:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 182 proven. 45 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-08 16:14:11,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:14:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:14:14,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:14:14,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453020495] [2024-11-08 16:14:14,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453020495] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:14:14,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:14:14,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-08 16:14:14,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741133666] [2024-11-08 16:14:14,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:14:14,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:14:14,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:14:14,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:14:14,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:14:14,332 INFO L87 Difference]: Start difference. First operand 317 states and 424 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:14:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:14:18,808 INFO L93 Difference]: Finished difference Result 691 states and 941 transitions. [2024-11-08 16:14:18,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:14:18,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2024-11-08 16:14:18,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:14:18,814 INFO L225 Difference]: With dead ends: 691 [2024-11-08 16:14:18,815 INFO L226 Difference]: Without dead ends: 445 [2024-11-08 16:14:18,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 275 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:14:18,817 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 64 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:14:18,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 400 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 16:14:18,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-08 16:14:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 353. [2024-11-08 16:14:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 289 states have (on average 1.301038062283737) internal successors, (376), 290 states have internal predecessors, (376), 51 states have call successors, (51), 12 states have call predecessors, (51), 12 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 16:14:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 478 transitions. [2024-11-08 16:14:18,872 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 478 transitions. Word has length 144 [2024-11-08 16:14:18,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:14:18,873 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 478 transitions. [2024-11-08 16:14:18,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:14:18,874 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 478 transitions. [2024-11-08 16:14:18,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 16:14:18,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:14:18,877 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:14:18,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-08 16:14:19,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:19,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:14:19,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:14:19,079 INFO L85 PathProgramCache]: Analyzing trace with hash 511016934, now seen corresponding path program 1 times [2024-11-08 16:14:19,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:14:19,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794655568] [2024-11-08 16:14:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:14:19,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:19,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:14:19,082 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:14:19,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-08 16:14:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:19,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:14:19,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:14:20,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:14:20,420 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:14:20,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794655568] [2024-11-08 16:14:20,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794655568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:14:20,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:14:20,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:14:20,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949366173] [2024-11-08 16:14:20,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:14:20,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:14:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:14:20,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:14:20,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:14:20,424 INFO L87 Difference]: Start difference. First operand 353 states and 478 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:14:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:14:21,660 INFO L93 Difference]: Finished difference Result 759 states and 1039 transitions. [2024-11-08 16:14:21,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:14:21,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2024-11-08 16:14:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:14:21,666 INFO L225 Difference]: With dead ends: 759 [2024-11-08 16:14:21,666 INFO L226 Difference]: Without dead ends: 477 [2024-11-08 16:14:21,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:14:21,669 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 63 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:14:21,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 806 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 16:14:21,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-08 16:14:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 385. [2024-11-08 16:14:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 321 states have (on average 1.308411214953271) internal successors, (420), 322 states have internal predecessors, (420), 51 states have call successors, (51), 12 states have call predecessors, (51), 12 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 16:14:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 522 transitions. [2024-11-08 16:14:21,739 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 522 transitions. Word has length 144 [2024-11-08 16:14:21,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:14:21,740 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 522 transitions. [2024-11-08 16:14:21,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:14:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 522 transitions. [2024-11-08 16:14:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:14:21,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:14:21,744 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:14:21,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-08 16:14:21,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:21,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:14:21,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:14:21,949 INFO L85 PathProgramCache]: Analyzing trace with hash 174610050, now seen corresponding path program 1 times [2024-11-08 16:14:21,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:14:21,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156136241] [2024-11-08 16:14:21,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:14:21,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:21,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:14:21,951 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:14:21,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-08 16:14:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:22,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 16:14:22,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:14:22,991 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:14:22,991 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:14:22,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156136241] [2024-11-08 16:14:22,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156136241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:14:22,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:14:22,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:14:22,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301773010] [2024-11-08 16:14:22,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:14:22,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:14:22,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:14:22,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:14:22,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:14:22,994 INFO L87 Difference]: Start difference. First operand 385 states and 522 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:14:26,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:14:26,620 INFO L93 Difference]: Finished difference Result 777 states and 1061 transitions. [2024-11-08 16:14:26,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:14:26,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-08 16:14:26,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:14:26,625 INFO L225 Difference]: With dead ends: 777 [2024-11-08 16:14:26,626 INFO L226 Difference]: Without dead ends: 463 [2024-11-08 16:14:26,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:14:26,628 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 43 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:14:26,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 459 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-08 16:14:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-08 16:14:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 393. [2024-11-08 16:14:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 329 states have (on average 1.3009118541033435) internal successors, (428), 330 states have internal predecessors, (428), 51 states have call successors, (51), 12 states have call predecessors, (51), 12 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 16:14:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 530 transitions. [2024-11-08 16:14:26,693 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 530 transitions. Word has length 145 [2024-11-08 16:14:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:14:26,694 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 530 transitions. [2024-11-08 16:14:26,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:14:26,694 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 530 transitions. [2024-11-08 16:14:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:14:26,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:14:26,696 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:14:26,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-08 16:14:26,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:26,897 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:14:26,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:14:26,898 INFO L85 PathProgramCache]: Analyzing trace with hash 393464768, now seen corresponding path program 1 times [2024-11-08 16:14:26,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:14:26,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442921987] [2024-11-08 16:14:26,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:14:26,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:26,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:14:26,900 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:14:26,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-08 16:14:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:27,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:14:27,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:14:28,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:14:28,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:14:28,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442921987] [2024-11-08 16:14:28,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442921987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:14:28,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:14:28,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:14:28,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895344252] [2024-11-08 16:14:28,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:14:28,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:14:28,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:14:28,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:14:28,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:14:28,105 INFO L87 Difference]: Start difference. First operand 393 states and 530 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:14:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:14:28,884 INFO L93 Difference]: Finished difference Result 799 states and 1087 transitions. [2024-11-08 16:14:28,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:14:28,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-08 16:14:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:14:28,889 INFO L225 Difference]: With dead ends: 799 [2024-11-08 16:14:28,890 INFO L226 Difference]: Without dead ends: 477 [2024-11-08 16:14:28,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:14:28,892 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 78 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:14:28,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 635 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:14:28,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-08 16:14:28,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 393. [2024-11-08 16:14:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 329 states have (on average 1.2887537993920972) internal successors, (424), 330 states have internal predecessors, (424), 51 states have call successors, (51), 12 states have call predecessors, (51), 12 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 16:14:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 526 transitions. [2024-11-08 16:14:28,946 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 526 transitions. Word has length 145 [2024-11-08 16:14:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:14:28,950 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 526 transitions. [2024-11-08 16:14:28,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:14:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 526 transitions. [2024-11-08 16:14:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:14:28,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:14:28,957 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:14:28,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-08 16:14:29,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:29,159 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:14:29,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:14:29,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1850518530, now seen corresponding path program 1 times [2024-11-08 16:14:29,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:14:29,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465584030] [2024-11-08 16:14:29,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:14:29,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:29,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:14:29,166 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:14:29,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-08 16:14:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:29,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 16:14:29,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:29,611 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 87 treesize of output 86 [2024-11-08 16:14:30,090 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 173 treesize of output 143 [2024-11-08 16:14:33,837 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:14:33,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:14:33,838 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:14:33,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465584030] [2024-11-08 16:14:33,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465584030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:14:33,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:14:33,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:14:33,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282239129] [2024-11-08 16:14:33,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:14:33,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:14:33,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:14:33,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:14:33,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:14:33,840 INFO L87 Difference]: Start difference. First operand 393 states and 526 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:14:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:14:42,288 INFO L93 Difference]: Finished difference Result 891 states and 1209 transitions. [2024-11-08 16:14:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:14:42,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2024-11-08 16:14:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:14:42,293 INFO L225 Difference]: With dead ends: 891 [2024-11-08 16:14:42,293 INFO L226 Difference]: Without dead ends: 569 [2024-11-08 16:14:42,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:14:42,295 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 130 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:14:42,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 462 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2024-11-08 16:14:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-08 16:14:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 396. [2024-11-08 16:14:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 332 states have (on average 1.286144578313253) internal successors, (427), 332 states have internal predecessors, (427), 51 states have call successors, (51), 12 states have call predecessors, (51), 12 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 16:14:42,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 529 transitions. [2024-11-08 16:14:42,346 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 529 transitions. Word has length 145 [2024-11-08 16:14:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:14:42,347 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 529 transitions. [2024-11-08 16:14:42,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:14:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 529 transitions. [2024-11-08 16:14:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:14:42,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:14:42,349 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:14:42,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-08 16:14:42,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:42,550 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:14:42,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:14:42,551 INFO L85 PathProgramCache]: Analyzing trace with hash 822772138, now seen corresponding path program 1 times [2024-11-08 16:14:42,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:14:42,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493747270] [2024-11-08 16:14:42,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:14:42,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:42,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:14:42,553 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:14:42,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-08 16:14:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:42,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 16:14:42,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:43,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 16:14:43,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:43,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2024-11-08 16:14:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:14:43,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:14:43,976 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:14:43,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493747270] [2024-11-08 16:14:43,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493747270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:14:43,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:14:43,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:14:43,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116773009] [2024-11-08 16:14:43,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:14:43,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:14:43,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:14:43,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:14:43,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:14:43,980 INFO L87 Difference]: Start difference. First operand 396 states and 529 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:14:49,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:14:49,308 INFO L93 Difference]: Finished difference Result 900 states and 1202 transitions. [2024-11-08 16:14:49,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:14:49,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-08 16:14:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:14:49,313 INFO L225 Difference]: With dead ends: 900 [2024-11-08 16:14:49,314 INFO L226 Difference]: Without dead ends: 578 [2024-11-08 16:14:49,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:14:49,316 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 74 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:14:49,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 655 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-08 16:14:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-11-08 16:14:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 574. [2024-11-08 16:14:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 490 states have (on average 1.2673469387755103) internal successors, (621), 492 states have internal predecessors, (621), 67 states have call successors, (67), 16 states have call predecessors, (67), 16 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-08 16:14:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 755 transitions. [2024-11-08 16:14:49,397 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 755 transitions. Word has length 146 [2024-11-08 16:14:49,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:14:49,398 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 755 transitions. [2024-11-08 16:14:49,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:14:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 755 transitions. [2024-11-08 16:14:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:14:49,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:14:49,401 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:14:49,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-08 16:14:49,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:49,602 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:14:49,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:14:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1906641196, now seen corresponding path program 1 times [2024-11-08 16:14:49,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:14:49,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219031467] [2024-11-08 16:14:49,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:14:49,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:14:49,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:14:49,605 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:14:49,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-08 16:14:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:14:49,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 16:14:49,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:14:50,012 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 14 treesize of output 10 [2024-11-08 16:14:51,423 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 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-08 16:14:52,224 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 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-08 16:14:53,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:53,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 32 [2024-11-08 16:14:54,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:54,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 32 [2024-11-08 16:14:56,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:56,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 32 [2024-11-08 16:14:57,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:57,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 32 [2024-11-08 16:14:59,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:14:59,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 32 [2024-11-08 16:15:00,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:15:00,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 32 [2024-11-08 16:15:03,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:15:03,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 62 treesize of output 46 [2024-11-08 16:15:04,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:15:04,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 29 [2024-11-08 16:15:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 182 proven. 45 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-08 16:15:04,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:15:06,986 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:15:06,987 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:15:06,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219031467] [2024-11-08 16:15:06,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219031467] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:15:06,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:15:06,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-08 16:15:06,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417520098] [2024-11-08 16:15:06,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:15:06,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:15:06,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:15:06,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:15:06,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:15:06,990 INFO L87 Difference]: Start difference. First operand 574 states and 755 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:15:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:15:10,685 INFO L93 Difference]: Finished difference Result 1138 states and 1501 transitions. [2024-11-08 16:15:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:15:10,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-08 16:15:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:15:10,692 INFO L225 Difference]: With dead ends: 1138 [2024-11-08 16:15:10,692 INFO L226 Difference]: Without dead ends: 638 [2024-11-08 16:15:10,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 273 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:15:10,695 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 150 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:15:10,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 386 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-08 16:15:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-08 16:15:10,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 539. [2024-11-08 16:15:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 455 states have (on average 1.2505494505494505) internal successors, (569), 457 states have internal predecessors, (569), 67 states have call successors, (67), 16 states have call predecessors, (67), 16 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-08 16:15:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 703 transitions. [2024-11-08 16:15:10,768 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 703 transitions. Word has length 146 [2024-11-08 16:15:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:15:10,769 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 703 transitions. [2024-11-08 16:15:10,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:15:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 703 transitions. [2024-11-08 16:15:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:15:10,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:15:10,772 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:15:10,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-08 16:15:10,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:15:10,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:15:10,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:15:10,974 INFO L85 PathProgramCache]: Analyzing trace with hash 925428396, now seen corresponding path program 1 times [2024-11-08 16:15:10,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:15:10,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456695065] [2024-11-08 16:15:10,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:15:10,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:15:10,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:15:10,976 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:15:10,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-08 16:15:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:15:11,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-08 16:15:11,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:15:11,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 16:15:11,538 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 14 treesize of output 10 [2024-11-08 16:15:12,057 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 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-08 16:15:12,498 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 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-08 16:15:13,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:15:13,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 26 [2024-11-08 16:15:14,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:15:14,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 26 [2024-11-08 16:15:15,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:15:15,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 26 [2024-11-08 16:15:16,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:15:16,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-08 16:15:17,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:15:17,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 60 [2024-11-08 16:15:19,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:15:19,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 113 treesize of output 69 [2024-11-08 16:15:20,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:15:20,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 69 [2024-11-08 16:15:21,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:15:21,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 50 [2024-11-08 16:15:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 384 proven. 15 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-08 16:15:22,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:15:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:15:27,045 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:15:27,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456695065] [2024-11-08 16:15:27,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456695065] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:15:27,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:15:27,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 22 [2024-11-08 16:15:27,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459956965] [2024-11-08 16:15:27,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:15:27,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:15:27,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:15:27,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:15:27,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-11-08 16:15:27,048 INFO L87 Difference]: Start difference. First operand 539 states and 703 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:15:35,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:15:35,034 INFO L93 Difference]: Finished difference Result 787 states and 1037 transitions. [2024-11-08 16:15:35,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:15:35,036 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-08 16:15:35,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:15:35,039 INFO L225 Difference]: With dead ends: 787 [2024-11-08 16:15:35,040 INFO L226 Difference]: Without dead ends: 535 [2024-11-08 16:15:35,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2024-11-08 16:15:35,042 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 239 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:15:35,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 591 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-08 16:15:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-08 16:15:35,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 531. [2024-11-08 16:15:35,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 447 states have (on average 1.250559284116331) internal successors, (559), 449 states have internal predecessors, (559), 67 states have call successors, (67), 16 states have call predecessors, (67), 16 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-08 16:15:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 693 transitions. [2024-11-08 16:15:35,118 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 693 transitions. Word has length 146 [2024-11-08 16:15:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:15:35,119 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 693 transitions. [2024-11-08 16:15:35,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:15:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 693 transitions. [2024-11-08 16:15:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 16:15:35,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:15:35,121 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:15:35,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-08 16:15:35,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:15:35,323 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:15:35,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:15:35,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1612508517, now seen corresponding path program 1 times [2024-11-08 16:15:35,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:15:35,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579987692] [2024-11-08 16:15:35,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:15:35,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:15:35,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:15:35,329 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:15:35,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-08 16:15:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:15:35,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:15:35,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:15:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:15:35,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:15:35,788 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:15:35,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579987692] [2024-11-08 16:15:35,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579987692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:15:35,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:15:35,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:15:35,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831011395] [2024-11-08 16:15:35,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:15:35,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:15:35,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:15:35,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:15:35,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:15:35,791 INFO L87 Difference]: Start difference. First operand 531 states and 693 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:15:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:15:35,997 INFO L93 Difference]: Finished difference Result 993 states and 1309 transitions. [2024-11-08 16:15:35,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:15:35,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-08 16:15:36,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:15:36,003 INFO L225 Difference]: With dead ends: 993 [2024-11-08 16:15:36,003 INFO L226 Difference]: Without dead ends: 536 [2024-11-08 16:15:36,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:15:36,006 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:15:36,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:15:36,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-08 16:15:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2024-11-08 16:15:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 452 states have (on average 1.247787610619469) internal successors, (564), 454 states have internal predecessors, (564), 67 states have call successors, (67), 16 states have call predecessors, (67), 16 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-08 16:15:36,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 698 transitions. [2024-11-08 16:15:36,078 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 698 transitions. Word has length 148 [2024-11-08 16:15:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:15:36,079 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 698 transitions. [2024-11-08 16:15:36,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:15:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 698 transitions. [2024-11-08 16:15:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 16:15:36,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:15:36,082 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:15:36,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-08 16:15:36,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:15:36,283 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:15:36,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:15:36,284 INFO L85 PathProgramCache]: Analyzing trace with hash 426496175, now seen corresponding path program 1 times [2024-11-08 16:15:36,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:15:36,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448805566] [2024-11-08 16:15:36,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:15:36,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:15:36,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:15:36,286 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:15:36,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-08 16:15:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:15:36,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:15:36,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:15:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 16:15:36,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:15:36,768 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:15:36,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448805566] [2024-11-08 16:15:36,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448805566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:15:36,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:15:36,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:15:36,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399542934] [2024-11-08 16:15:36,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:15:36,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:15:36,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:15:36,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:15:36,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:15:36,771 INFO L87 Difference]: Start difference. First operand 536 states and 698 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:15:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:15:36,976 INFO L93 Difference]: Finished difference Result 1002 states and 1317 transitions. [2024-11-08 16:15:36,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:15:36,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-08 16:15:36,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:15:36,980 INFO L225 Difference]: With dead ends: 1002 [2024-11-08 16:15:36,981 INFO L226 Difference]: Without dead ends: 540 [2024-11-08 16:15:36,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:15:36,983 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:15:36,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:15:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-08 16:15:37,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2024-11-08 16:15:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 456 states have (on average 1.2456140350877194) internal successors, (568), 458 states have internal predecessors, (568), 67 states have call successors, (67), 16 states have call predecessors, (67), 16 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2024-11-08 16:15:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 702 transitions. [2024-11-08 16:15:37,057 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 702 transitions. Word has length 148 [2024-11-08 16:15:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:15:37,058 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 702 transitions. [2024-11-08 16:15:37,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 16:15:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 702 transitions. [2024-11-08 16:15:37,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 16:15:37,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:15:37,061 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:15:37,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-08 16:15:37,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:15:37,262 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:15:37,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:15:37,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1946036454, now seen corresponding path program 1 times [2024-11-08 16:15:37,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:15:37,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042913925] [2024-11-08 16:15:37,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:15:37,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:15:37,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:15:37,265 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:15:37,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eed84719-10e3-45ca-8be9-f8415704ddfd/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-08 16:15:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:15:37,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-08 16:15:37,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:15:37,768 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 92 treesize of output 91 [2024-11-08 16:15:38,298 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 0 case distinctions, treesize of input 130 treesize of output 117 [2024-11-08 16:15:39,631 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 0 case distinctions, treesize of input 135 treesize of output 122 [2024-11-08 16:15:41,107 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 0 case distinctions, treesize of input 135 treesize of output 120 [2024-11-08 16:15:42,930 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 0 case distinctions, treesize of input 135 treesize of output 120 [2024-11-08 16:15:45,774 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 0 case distinctions, treesize of input 140 treesize of output 125 [2024-11-08 16:15:54,441 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 0 case distinctions, treesize of input 146 treesize of output 129 [2024-11-08 16:16:26,568 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 0 case distinctions, treesize of input 161 treesize of output 140 [2024-11-08 16:16:41,762 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 0 case distinctions, treesize of input 167 treesize of output 144 [2024-11-08 16:17:08,686 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 0 case distinctions, treesize of input 162 treesize of output 139 [2024-11-08 16:17:26,575 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 0 case distinctions, treesize of input 162 treesize of output 139 [2024-11-08 16:17:49,612 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 0 case distinctions, treesize of input 164 treesize of output 143 [2024-11-08 16:18:28,894 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 0 case distinctions, treesize of input 192 treesize of output 169