./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:56:33,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:56:33,747 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:56:33,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:56:33,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:56:33,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:56:33,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:56:33,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:56:33,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:56:33,812 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:56:33,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:56:33,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:56:33,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:56:33,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:56:33,817 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:56:33,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:56:33,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:56:33,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:56:33,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:56:33,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:56:33,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:56:33,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:56:33,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:56:33,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:56:33,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:56:33,841 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:56:33,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:56:33,841 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:56:33,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:56:33,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:56:33,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:56:33,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:56:33,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:56:33,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:56:33,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:56:33,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:56:33,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:56:33,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:56:33,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:56:33,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:56:33,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:56:33,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:56:33,846 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_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 -> 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 [2024-11-08 17:56:34,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:56:34,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:56:34,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:56:34,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:56:34,206 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:56:34,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i Unable to find full path for "g++" [2024-11-08 17:56:36,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:56:36,381 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:56:36,382 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2024-11-08 17:56:36,411 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/data/de7a72d9f/d850424e173642dfbfb7f6dd7af1983d/FLAGb7697aed2 [2024-11-08 17:56:36,746 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/data/de7a72d9f/d850424e173642dfbfb7f6dd7af1983d [2024-11-08 17:56:36,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:56:36,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:56:36,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:56:36,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:56:36,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:56:36,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:56:36" (1/1) ... [2024-11-08 17:56:36,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3acb7700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:56:36, skipping insertion in model container [2024-11-08 17:56:36,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:56:36" (1/1) ... [2024-11-08 17:56:36,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:56:36,993 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_04ba324e-f5ff-48e8-8134-cc1cf188a32b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i[917,930] [2024-11-08 17:56:37,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:56:37,081 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:56:37,093 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_04ba324e-f5ff-48e8-8134-cc1cf188a32b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i[917,930] [2024-11-08 17:56:37,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:56:37,154 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:56:37,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:56:37 WrapperNode [2024-11-08 17:56:37,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:56:37,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:56:37,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:56:37,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:56:37,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:56:37" (1/1) ... [2024-11-08 17:56:37,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:56:37" (1/1) ... [2024-11-08 17:56:37,228 INFO L138 Inliner]: procedures = 30, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2024-11-08 17:56:37,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:56:37,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:56:37,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:56:37,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:56:37,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:56:37" (1/1) ... [2024-11-08 17:56:37,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:56:37" (1/1) ... [2024-11-08 17:56:37,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:56:37" (1/1) ... [2024-11-08 17:56:37,267 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 17:56:37,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:56:37" (1/1) ... [2024-11-08 17:56:37,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:56:37" (1/1) ... [2024-11-08 17:56:37,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:56:37" (1/1) ... [2024-11-08 17:56:37,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:56:37" (1/1) ... [2024-11-08 17:56:37,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:56:37" (1/1) ... [2024-11-08 17:56:37,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:56:37" (1/1) ... [2024-11-08 17:56:37,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:56:37,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:56:37,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:56:37,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:56:37,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:56:37" (1/1) ... [2024-11-08 17:56:37,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:56:37,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:56:37,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:56:37,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:56:37,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:56:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 17:56:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 17:56:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 17:56:37,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 17:56:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 17:56:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 17:56:37,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:56:37,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:56:37,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 17:56:37,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:56:37,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:56:37,567 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:56:37,570 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:56:38,234 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2024-11-08 17:56:38,234 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:56:38,257 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:56:38,257 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:56:38,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:56:38 BoogieIcfgContainer [2024-11-08 17:56:38,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:56:38,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:56:38,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:56:38,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:56:38,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:56:36" (1/3) ... [2024-11-08 17:56:38,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4371d0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:56:38, skipping insertion in model container [2024-11-08 17:56:38,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:56:37" (2/3) ... [2024-11-08 17:56:38,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4371d0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:56:38, skipping insertion in model container [2024-11-08 17:56:38,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:56:38" (3/3) ... [2024-11-08 17:56:38,273 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-33.i [2024-11-08 17:56:38,290 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:56:38,290 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:56:38,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:56:38,359 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;@473beae6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:56:38,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:56:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:56:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 17:56:38,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:56:38,377 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:56:38,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:56:38,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:56:38,384 INFO L85 PathProgramCache]: Analyzing trace with hash -217821974, now seen corresponding path program 1 times [2024-11-08 17:56:38,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:56:38,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743949570] [2024-11-08 17:56:38,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:38,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:56:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:56:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:56:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:56:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:56:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:56:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:56:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:56:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:56:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:56:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:56:39,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:56:39,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743949570] [2024-11-08 17:56:39,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743949570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:56:39,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:56:39,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:56:39,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108623794] [2024-11-08 17:56:39,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:56:39,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:56:39,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:56:39,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:56:39,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:56:39,231 INFO L87 Difference]: Start difference. First operand has 107 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:56:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:56:39,310 INFO L93 Difference]: Finished difference Result 209 states and 322 transitions. [2024-11-08 17:56:39,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:56:39,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2024-11-08 17:56:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:56:39,325 INFO L225 Difference]: With dead ends: 209 [2024-11-08 17:56:39,325 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 17:56:39,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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 17:56:39,337 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:56:39,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:56:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 17:56:39,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-08 17:56:39,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:56:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2024-11-08 17:56:39,401 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 98 [2024-11-08 17:56:39,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:56:39,404 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2024-11-08 17:56:39,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:56:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-11-08 17:56:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 17:56:39,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:56:39,410 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:56:39,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:56:39,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:56:39,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:56:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash -419645908, now seen corresponding path program 1 times [2024-11-08 17:56:39,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:56:39,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064355552] [2024-11-08 17:56:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:39,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:56:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:56:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:56:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:56:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:56:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:56:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:56:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:56:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:56:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:56:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:56:39,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:56:39,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064355552] [2024-11-08 17:56:39,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064355552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:56:39,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:56:39,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:56:39,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882524604] [2024-11-08 17:56:39,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:56:39,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:56:39,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:56:39,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:56:39,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:56:39,858 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:56:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:56:39,918 INFO L93 Difference]: Finished difference Result 210 states and 307 transitions. [2024-11-08 17:56:39,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:56:39,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-08 17:56:39,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:56:39,921 INFO L225 Difference]: With dead ends: 210 [2024-11-08 17:56:39,921 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 17:56:39,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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 17:56:39,923 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 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 17:56:39,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:56:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 17:56:39,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-08 17:56:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 96 states have internal predecessors, (137), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:56:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-11-08 17:56:39,942 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 98 [2024-11-08 17:56:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:56:39,946 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-11-08 17:56:39,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:56:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-11-08 17:56:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 17:56:39,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:56:39,953 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:56:39,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:56:39,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:56:39,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:56:39,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1355361454, now seen corresponding path program 1 times [2024-11-08 17:56:39,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:56:39,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60459427] [2024-11-08 17:56:39,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:39,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:56:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:56:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:56:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:56:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:56:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:56:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:56:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:56:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:56:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:56:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,260 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:56:40,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:56:40,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60459427] [2024-11-08 17:56:40,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60459427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:56:40,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:56:40,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:56:40,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048071062] [2024-11-08 17:56:40,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:56:40,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:56:40,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:56:40,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:56:40,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:56:40,267 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:56:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:56:40,302 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2024-11-08 17:56:40,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:56:40,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-08 17:56:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:56:40,305 INFO L225 Difference]: With dead ends: 214 [2024-11-08 17:56:40,307 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 17:56:40,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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 17:56:40,309 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 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 17:56:40,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:56:40,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 17:56:40,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-11-08 17:56:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 98 states have internal predecessors, (139), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:56:40,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-08 17:56:40,325 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 98 [2024-11-08 17:56:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:56:40,327 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-08 17:56:40,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:56:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-08 17:56:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 17:56:40,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:56:40,329 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:56:40,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:56:40,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:56:40,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:56:40,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1357208496, now seen corresponding path program 1 times [2024-11-08 17:56:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:56:40,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745922483] [2024-11-08 17:56:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:40,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:56:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:56:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:56:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:56:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:56:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:56:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:56:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:56:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:56:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:56:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:40,822 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:56:40,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:56:40,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745922483] [2024-11-08 17:56:40,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745922483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:56:40,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:56:40,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:56:40,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118488222] [2024-11-08 17:56:40,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:56:40,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:56:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:56:40,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:56:40,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:56:40,831 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:56:41,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:56:41,083 INFO L93 Difference]: Finished difference Result 272 states and 393 transitions. [2024-11-08 17:56:41,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:56:41,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-08 17:56:41,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:56:41,088 INFO L225 Difference]: With dead ends: 272 [2024-11-08 17:56:41,088 INFO L226 Difference]: Without dead ends: 166 [2024-11-08 17:56:41,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 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 17:56:41,090 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 68 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:56:41,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 512 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:56:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-08 17:56:41,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 126. [2024-11-08 17:56:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 115 states have (on average 1.434782608695652) internal successors, (165), 115 states have internal predecessors, (165), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:56:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2024-11-08 17:56:41,111 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 98 [2024-11-08 17:56:41,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:56:41,111 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2024-11-08 17:56:41,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:56:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2024-11-08 17:56:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 17:56:41,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:56:41,117 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:56:41,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:56:41,118 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:56:41,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:56:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash 77344818, now seen corresponding path program 1 times [2024-11-08 17:56:41,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:56:41,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423435630] [2024-11-08 17:56:41,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:41,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:56:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:42,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:56:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:42,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:56:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:42,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:56:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:42,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:56:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:42,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:56:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:42,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:56:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:42,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:56:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:42,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:56:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:42,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:56:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:56:42,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:56:42,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423435630] [2024-11-08 17:56:42,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423435630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:56:42,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:56:42,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:56:42,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310718949] [2024-11-08 17:56:42,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:56:42,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:56:42,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:56:42,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:56:42,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:56:42,150 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:56:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:56:42,579 INFO L93 Difference]: Finished difference Result 291 states and 421 transitions. [2024-11-08 17:56:42,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:56:42,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-08 17:56:42,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:56:42,582 INFO L225 Difference]: With dead ends: 291 [2024-11-08 17:56:42,582 INFO L226 Difference]: Without dead ends: 168 [2024-11-08 17:56:42,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:56:42,583 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 283 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:56:42,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 615 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:56:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-08 17:56:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 128. [2024-11-08 17:56:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 117 states have internal predecessors, (167), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:56:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 185 transitions. [2024-11-08 17:56:42,608 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 185 transitions. Word has length 98 [2024-11-08 17:56:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:56:42,611 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 185 transitions. [2024-11-08 17:56:42,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:56:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 185 transitions. [2024-11-08 17:56:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 17:56:42,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:56:42,614 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:56:42,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:56:42,615 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:56:42,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:56:42,615 INFO L85 PathProgramCache]: Analyzing trace with hash -448229838, now seen corresponding path program 1 times [2024-11-08 17:56:42,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:56:42,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868418354] [2024-11-08 17:56:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:42,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:56:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:43,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:56:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:43,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:56:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:43,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:56:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:43,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:56:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:43,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:56:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:43,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:56:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:43,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:56:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:43,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:56:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:43,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:56:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:56:43,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:56:43,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868418354] [2024-11-08 17:56:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868418354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:56:43,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:56:43,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:56:43,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252568969] [2024-11-08 17:56:43,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:56:43,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:56:43,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:56:43,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:56:43,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:56:43,918 INFO L87 Difference]: Start difference. First operand 128 states and 185 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:56:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:56:44,560 INFO L93 Difference]: Finished difference Result 302 states and 436 transitions. [2024-11-08 17:56:44,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:56:44,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2024-11-08 17:56:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:56:44,563 INFO L225 Difference]: With dead ends: 302 [2024-11-08 17:56:44,564 INFO L226 Difference]: Without dead ends: 177 [2024-11-08 17:56:44,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:56:44,567 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 513 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:56:44,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 418 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:56:44,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-08 17:56:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 134. [2024-11-08 17:56:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 123 states have internal predecessors, (176), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:56:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 194 transitions. [2024-11-08 17:56:44,592 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 194 transitions. Word has length 98 [2024-11-08 17:56:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:56:44,594 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 194 transitions. [2024-11-08 17:56:44,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:56:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 194 transitions. [2024-11-08 17:56:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 17:56:44,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:56:44,600 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:56:44,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:56:44,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:56:44,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:56:44,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1728093516, now seen corresponding path program 1 times [2024-11-08 17:56:44,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:56:44,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321808370] [2024-11-08 17:56:44,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:44,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:56:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:45,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:56:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:45,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:56:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:45,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:56:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:45,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:56:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:45,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:56:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:45,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:56:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:45,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:56:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:45,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:56:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:45,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:56:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 17:56:45,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:56:45,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321808370] [2024-11-08 17:56:45,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321808370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:56:45,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471451130] [2024-11-08 17:56:45,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:45,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:56:45,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:56:45,977 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:56:45,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:56:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:46,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-08 17:56:46,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:56:46,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-08 17:56:46,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-08 17:56:47,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2024-11-08 17:56:47,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2024-11-08 17:56:47,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2024-11-08 17:56:48,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2024-11-08 17:56:48,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:48,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 38 [2024-11-08 17:56:48,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:48,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 17 [2024-11-08 17:56:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 17:56:48,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:56:48,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471451130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:56:48,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:56:48,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-11-08 17:56:48,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755117225] [2024-11-08 17:56:48,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:56:48,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 17:56:48,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:56:48,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 17:56:48,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-08 17:56:48,699 INFO L87 Difference]: Start difference. First operand 134 states and 194 transitions. Second operand has 18 states, 16 states have (on average 5.8125) internal successors, (93), 18 states have internal predecessors, (93), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-08 17:56:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:56:50,212 INFO L93 Difference]: Finished difference Result 412 states and 590 transitions. [2024-11-08 17:56:50,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 17:56:50,212 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.8125) internal successors, (93), 18 states have internal predecessors, (93), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 98 [2024-11-08 17:56:50,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:56:50,214 INFO L225 Difference]: With dead ends: 412 [2024-11-08 17:56:50,214 INFO L226 Difference]: Without dead ends: 281 [2024-11-08 17:56:50,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=263, Invalid=997, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 17:56:50,217 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 185 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:56:50,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1208 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 17:56:50,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-08 17:56:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 185. [2024-11-08 17:56:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 162 states have (on average 1.382716049382716) internal successors, (224), 162 states have internal predecessors, (224), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 17:56:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 260 transitions. [2024-11-08 17:56:50,253 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 260 transitions. Word has length 98 [2024-11-08 17:56:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:56:50,254 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 260 transitions. [2024-11-08 17:56:50,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.8125) internal successors, (93), 18 states have internal predecessors, (93), 6 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-08 17:56:50,254 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 260 transitions. [2024-11-08 17:56:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 17:56:50,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:56:50,256 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:56:50,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:56:50,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:56:50,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:56:50,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:56:50,457 INFO L85 PathProgramCache]: Analyzing trace with hash -341890122, now seen corresponding path program 1 times [2024-11-08 17:56:50,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:56:50,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300023148] [2024-11-08 17:56:50,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:50,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:56:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:53,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:56:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:53,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:56:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:53,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:56:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:53,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:56:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:53,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:56:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:53,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:56:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:56:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:56:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:53,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:56:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:56:53,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:56:53,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300023148] [2024-11-08 17:56:53,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300023148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:56:53,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:56:53,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:56:53,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052178744] [2024-11-08 17:56:53,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:56:53,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:56:53,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:56:53,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:56:53,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:56:53,405 INFO L87 Difference]: Start difference. First operand 185 states and 260 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:56:54,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:56:54,336 INFO L93 Difference]: Finished difference Result 487 states and 695 transitions. [2024-11-08 17:56:54,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:56:54,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2024-11-08 17:56:54,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:56:54,339 INFO L225 Difference]: With dead ends: 487 [2024-11-08 17:56:54,339 INFO L226 Difference]: Without dead ends: 356 [2024-11-08 17:56:54,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:56:54,340 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 429 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:56:54,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 802 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:56:54,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-08 17:56:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 310. [2024-11-08 17:56:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 277 states have (on average 1.4007220216606497) internal successors, (388), 277 states have internal predecessors, (388), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:56:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 442 transitions. [2024-11-08 17:56:54,379 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 442 transitions. Word has length 98 [2024-11-08 17:56:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:56:54,379 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 442 transitions. [2024-11-08 17:56:54,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:56:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 442 transitions. [2024-11-08 17:56:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 17:56:54,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:56:54,381 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:56:54,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:56:54,382 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:56:54,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:56:54,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1872806040, now seen corresponding path program 1 times [2024-11-08 17:56:54,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:56:54,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985508643] [2024-11-08 17:56:54,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:54,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:56:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:54,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:56:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:54,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:56:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:54,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:56:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:54,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:56:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:54,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:56:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:54,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:56:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:54,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:56:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:54,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:56:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:54,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:56:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:56:54,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:56:54,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985508643] [2024-11-08 17:56:54,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985508643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:56:54,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:56:54,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:56:54,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826271025] [2024-11-08 17:56:54,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:56:54,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:56:54,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:56:54,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:56:54,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:56:54,762 INFO L87 Difference]: Start difference. First operand 310 states and 442 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:56:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:56:55,359 INFO L93 Difference]: Finished difference Result 670 states and 960 transitions. [2024-11-08 17:56:55,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:56:55,360 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2024-11-08 17:56:55,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:56:55,363 INFO L225 Difference]: With dead ends: 670 [2024-11-08 17:56:55,364 INFO L226 Difference]: Without dead ends: 414 [2024-11-08 17:56:55,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:56:55,366 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 348 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:56:55,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 546 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:56:55,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-08 17:56:55,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 334. [2024-11-08 17:56:55,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 301 states have (on average 1.4019933554817277) internal successors, (422), 301 states have internal predecessors, (422), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:56:55,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 476 transitions. [2024-11-08 17:56:55,405 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 476 transitions. Word has length 99 [2024-11-08 17:56:55,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:56:55,406 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 476 transitions. [2024-11-08 17:56:55,406 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:56:55,406 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 476 transitions. [2024-11-08 17:56:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 17:56:55,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:56:55,408 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:56:55,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:56:55,408 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:56:55,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:56:55,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1210696167, now seen corresponding path program 1 times [2024-11-08 17:56:55,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:56:55,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439419317] [2024-11-08 17:56:55,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:55,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:56:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:55,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:56:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:55,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:56:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:55,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:56:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:55,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:56:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:55,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:56:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:55,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:56:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:55,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:56:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:55,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:56:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:55,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:56:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:56:55,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:56:55,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439419317] [2024-11-08 17:56:55,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439419317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:56:55,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:56:55,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:56:55,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839576471] [2024-11-08 17:56:55,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:56:55,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:56:55,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:56:55,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:56:55,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:56:55,743 INFO L87 Difference]: Start difference. First operand 334 states and 476 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:56:56,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:56:56,159 INFO L93 Difference]: Finished difference Result 697 states and 996 transitions. [2024-11-08 17:56:56,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:56:56,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-08 17:56:56,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:56:56,163 INFO L225 Difference]: With dead ends: 697 [2024-11-08 17:56:56,163 INFO L226 Difference]: Without dead ends: 417 [2024-11-08 17:56:56,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:56:56,164 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 278 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:56:56,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 562 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:56:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-08 17:56:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 334. [2024-11-08 17:56:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 301 states have (on average 1.388704318936877) internal successors, (418), 301 states have internal predecessors, (418), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:56:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 472 transitions. [2024-11-08 17:56:56,205 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 472 transitions. Word has length 99 [2024-11-08 17:56:56,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:56:56,206 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 472 transitions. [2024-11-08 17:56:56,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:56:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 472 transitions. [2024-11-08 17:56:56,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 17:56:56,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:56:56,207 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:56:56,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:56:56,208 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:56:56,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:56:56,208 INFO L85 PathProgramCache]: Analyzing trace with hash 75797551, now seen corresponding path program 1 times [2024-11-08 17:56:56,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:56:56,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45490681] [2024-11-08 17:56:56,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:56,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:56:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:56:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:56:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:56:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:56:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:56:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:56:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:56:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:56:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:56:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:56:56,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:56:56,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45490681] [2024-11-08 17:56:56,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45490681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:56:56,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:56:56,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:56:56,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605464370] [2024-11-08 17:56:56,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:56:56,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:56:56,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:56:56,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:56:56,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:56:56,359 INFO L87 Difference]: Start difference. First operand 334 states and 472 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:56:56,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:56:56,405 INFO L93 Difference]: Finished difference Result 483 states and 690 transitions. [2024-11-08 17:56:56,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:56:56,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-08 17:56:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:56:56,409 INFO L225 Difference]: With dead ends: 483 [2024-11-08 17:56:56,409 INFO L226 Difference]: Without dead ends: 340 [2024-11-08 17:56:56,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 17:56:56,410 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:56:56,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:56:56,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-08 17:56:56,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2024-11-08 17:56:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 307 states have (on average 1.3811074918566775) internal successors, (424), 307 states have internal predecessors, (424), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:56:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 478 transitions. [2024-11-08 17:56:56,447 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 478 transitions. Word has length 100 [2024-11-08 17:56:56,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:56:56,448 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 478 transitions. [2024-11-08 17:56:56,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:56:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 478 transitions. [2024-11-08 17:56:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 17:56:56,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:56:56,449 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:56:56,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:56:56,450 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:56:56,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:56:56,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1141443599, now seen corresponding path program 1 times [2024-11-08 17:56:56,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:56:56,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728065201] [2024-11-08 17:56:56,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:56,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:56:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:56:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:56:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:56:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:56:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:56:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:56:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:56:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:56:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:56:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:56:56,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:56:56,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728065201] [2024-11-08 17:56:56,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728065201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:56:56,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:56:56,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:56:56,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640460016] [2024-11-08 17:56:56,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:56:56,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:56:56,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:56:56,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:56:56,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:56:56,651 INFO L87 Difference]: Start difference. First operand 340 states and 478 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:56:56,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:56:56,707 INFO L93 Difference]: Finished difference Result 632 states and 895 transitions. [2024-11-08 17:56:56,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:56:56,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-08 17:56:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:56:56,710 INFO L225 Difference]: With dead ends: 632 [2024-11-08 17:56:56,710 INFO L226 Difference]: Without dead ends: 346 [2024-11-08 17:56:56,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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 17:56:56,712 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 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 17:56:56,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:56:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-08 17:56:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-11-08 17:56:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 313 states have (on average 1.3738019169329074) internal successors, (430), 313 states have internal predecessors, (430), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:56:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 484 transitions. [2024-11-08 17:56:56,752 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 484 transitions. Word has length 100 [2024-11-08 17:56:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:56:56,752 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 484 transitions. [2024-11-08 17:56:56,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:56:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 484 transitions. [2024-11-08 17:56:56,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 17:56:56,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:56:56,754 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:56:56,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:56:56,754 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:56:56,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:56:56,755 INFO L85 PathProgramCache]: Analyzing trace with hash -2142406447, now seen corresponding path program 1 times [2024-11-08 17:56:56,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:56:56,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651536544] [2024-11-08 17:56:56,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:56,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:56:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:58,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:56:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:58,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:56:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:58,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:56:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:58,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:56:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:58,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:56:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:58,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:56:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:58,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:56:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:58,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:56:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:58,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:56:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:56:58,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:56:58,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651536544] [2024-11-08 17:56:58,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651536544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:56:58,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:56:58,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:56:58,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281236945] [2024-11-08 17:56:58,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:56:58,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:56:58,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:56:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:56:58,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:56:58,384 INFO L87 Difference]: Start difference. First operand 346 states and 484 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:56:59,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:56:59,052 INFO L93 Difference]: Finished difference Result 739 states and 1042 transitions. [2024-11-08 17:56:59,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:56:59,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2024-11-08 17:56:59,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:56:59,054 INFO L225 Difference]: With dead ends: 739 [2024-11-08 17:56:59,055 INFO L226 Difference]: Without dead ends: 447 [2024-11-08 17:56:59,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:56:59,056 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 374 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:56:59,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 452 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:56:59,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-08 17:56:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 409. [2024-11-08 17:56:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 376 states have (on average 1.3829787234042554) internal successors, (520), 376 states have internal predecessors, (520), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:56:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 574 transitions. [2024-11-08 17:56:59,100 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 574 transitions. Word has length 100 [2024-11-08 17:56:59,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:56:59,101 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 574 transitions. [2024-11-08 17:56:59,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:56:59,101 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 574 transitions. [2024-11-08 17:56:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 17:56:59,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:56:59,102 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:56:59,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:56:59,103 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:56:59,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:56:59,103 INFO L85 PathProgramCache]: Analyzing trace with hash -570241257, now seen corresponding path program 1 times [2024-11-08 17:56:59,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:56:59,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831120231] [2024-11-08 17:56:59,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:56:59,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:56:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:59,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:56:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:59,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:56:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:59,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:56:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:59,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:56:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:59,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:56:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:59,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:56:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:59,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:56:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:59,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:56:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:59,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:56:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:56:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:56:59,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:56:59,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831120231] [2024-11-08 17:56:59,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831120231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:56:59,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:56:59,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:56:59,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326026020] [2024-11-08 17:56:59,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:56:59,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:56:59,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:56:59,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:56:59,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:56:59,955 INFO L87 Difference]: Start difference. First operand 409 states and 574 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:00,793 INFO L93 Difference]: Finished difference Result 860 states and 1208 transitions. [2024-11-08 17:57:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:57:00,794 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2024-11-08 17:57:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:00,797 INFO L225 Difference]: With dead ends: 860 [2024-11-08 17:57:00,797 INFO L226 Difference]: Without dead ends: 505 [2024-11-08 17:57:00,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:57:00,799 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 311 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:00,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 812 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:57:00,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-08 17:57:00,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 409. [2024-11-08 17:57:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 376 states have (on average 1.3829787234042554) internal successors, (520), 376 states have internal predecessors, (520), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:57:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 574 transitions. [2024-11-08 17:57:00,851 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 574 transitions. Word has length 100 [2024-11-08 17:57:00,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:00,852 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 574 transitions. [2024-11-08 17:57:00,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:00,852 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 574 transitions. [2024-11-08 17:57:00,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 17:57:00,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:00,854 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:00,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:57:00,854 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:00,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:00,854 INFO L85 PathProgramCache]: Analyzing trace with hash 575608915, now seen corresponding path program 1 times [2024-11-08 17:57:00,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:00,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644153984] [2024-11-08 17:57:00,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:00,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:01,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:01,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:01,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:01,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:01,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:01,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:01,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:01,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:01,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:01,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:01,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644153984] [2024-11-08 17:57:01,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644153984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:01,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:01,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 17:57:01,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704817291] [2024-11-08 17:57:01,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:01,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 17:57:01,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:01,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 17:57:01,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:57:01,742 INFO L87 Difference]: Start difference. First operand 409 states and 574 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:02,965 INFO L93 Difference]: Finished difference Result 1247 states and 1760 transitions. [2024-11-08 17:57:02,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:57:02,965 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-08 17:57:02,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:02,973 INFO L225 Difference]: With dead ends: 1247 [2024-11-08 17:57:02,973 INFO L226 Difference]: Without dead ends: 892 [2024-11-08 17:57:02,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2024-11-08 17:57:02,974 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 522 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:02,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1155 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 17:57:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-11-08 17:57:03,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 500. [2024-11-08 17:57:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 467 states have (on average 1.4154175588865097) internal successors, (661), 467 states have internal predecessors, (661), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:57:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 715 transitions. [2024-11-08 17:57:03,028 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 715 transitions. Word has length 100 [2024-11-08 17:57:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:03,028 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 715 transitions. [2024-11-08 17:57:03,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:03,029 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 715 transitions. [2024-11-08 17:57:03,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 17:57:03,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:03,030 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:03,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:57:03,031 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:03,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1205814909, now seen corresponding path program 1 times [2024-11-08 17:57:03,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:03,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868945770] [2024-11-08 17:57:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:03,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:03,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:03,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:03,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:03,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:03,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:03,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:03,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:03,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:03,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:03,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:03,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868945770] [2024-11-08 17:57:03,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868945770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:03,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:03,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:57:03,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449496787] [2024-11-08 17:57:03,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:03,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:57:03,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:03,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:57:03,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:57:03,393 INFO L87 Difference]: Start difference. First operand 500 states and 715 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:03,771 INFO L93 Difference]: Finished difference Result 1023 states and 1459 transitions. [2024-11-08 17:57:03,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:57:03,772 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2024-11-08 17:57:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:03,775 INFO L225 Difference]: With dead ends: 1023 [2024-11-08 17:57:03,776 INFO L226 Difference]: Without dead ends: 577 [2024-11-08 17:57:03,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:57:03,778 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 273 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:03,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 457 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:57:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-08 17:57:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 491. [2024-11-08 17:57:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 458 states have (on average 1.4039301310043668) internal successors, (643), 458 states have internal predecessors, (643), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:57:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 697 transitions. [2024-11-08 17:57:03,833 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 697 transitions. Word has length 101 [2024-11-08 17:57:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:03,834 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 697 transitions. [2024-11-08 17:57:03,834 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 697 transitions. [2024-11-08 17:57:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 17:57:03,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:03,836 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:03,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 17:57:03,837 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:03,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1797079145, now seen corresponding path program 1 times [2024-11-08 17:57:03,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:03,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090904582] [2024-11-08 17:57:03,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:03,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:04,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:04,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:04,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:04,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:04,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:04,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:04,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:04,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:04,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:04,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:04,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090904582] [2024-11-08 17:57:04,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090904582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:04,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:04,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 17:57:04,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385986016] [2024-11-08 17:57:04,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:04,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 17:57:04,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:04,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 17:57:04,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:57:04,641 INFO L87 Difference]: Start difference. First operand 491 states and 697 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:06,002 INFO L93 Difference]: Finished difference Result 1354 states and 1897 transitions. [2024-11-08 17:57:06,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:57:06,003 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2024-11-08 17:57:06,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:06,007 INFO L225 Difference]: With dead ends: 1354 [2024-11-08 17:57:06,007 INFO L226 Difference]: Without dead ends: 917 [2024-11-08 17:57:06,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2024-11-08 17:57:06,009 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 447 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:06,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1440 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:57:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-08 17:57:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 521. [2024-11-08 17:57:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 488 states have (on average 1.415983606557377) internal successors, (691), 488 states have internal predecessors, (691), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:57:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 745 transitions. [2024-11-08 17:57:06,069 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 745 transitions. Word has length 101 [2024-11-08 17:57:06,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:06,070 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 745 transitions. [2024-11-08 17:57:06,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:06,070 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 745 transitions. [2024-11-08 17:57:06,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 17:57:06,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:06,071 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:06,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:57:06,072 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:06,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:06,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1585787500, now seen corresponding path program 1 times [2024-11-08 17:57:06,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:06,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135573715] [2024-11-08 17:57:06,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:06,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:07,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:07,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:07,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:07,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:07,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:07,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:07,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:07,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:07,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:07,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:07,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135573715] [2024-11-08 17:57:07,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135573715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:07,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:07,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 17:57:07,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813260714] [2024-11-08 17:57:07,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:07,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 17:57:07,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:07,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 17:57:07,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:57:07,175 INFO L87 Difference]: Start difference. First operand 521 states and 745 transitions. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:08,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:08,939 INFO L93 Difference]: Finished difference Result 1514 states and 2121 transitions. [2024-11-08 17:57:08,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:57:08,940 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2024-11-08 17:57:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:08,944 INFO L225 Difference]: With dead ends: 1514 [2024-11-08 17:57:08,944 INFO L226 Difference]: Without dead ends: 1047 [2024-11-08 17:57:08,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2024-11-08 17:57:08,946 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 850 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:08,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1246 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:57:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-11-08 17:57:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 521. [2024-11-08 17:57:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 488 states have (on average 1.415983606557377) internal successors, (691), 488 states have internal predecessors, (691), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:57:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 745 transitions. [2024-11-08 17:57:08,995 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 745 transitions. Word has length 101 [2024-11-08 17:57:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:08,996 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 745 transitions. [2024-11-08 17:57:08,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 745 transitions. [2024-11-08 17:57:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 17:57:08,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:08,997 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:08,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 17:57:08,998 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:08,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1642003350, now seen corresponding path program 1 times [2024-11-08 17:57:08,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:08,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472205863] [2024-11-08 17:57:08,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:08,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:09,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:09,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472205863] [2024-11-08 17:57:09,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472205863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:09,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:09,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:57:09,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094279500] [2024-11-08 17:57:09,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:09,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:57:09,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:09,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:57:09,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:57:09,737 INFO L87 Difference]: Start difference. First operand 521 states and 745 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:11,185 INFO L93 Difference]: Finished difference Result 1215 states and 1741 transitions. [2024-11-08 17:57:11,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:57:11,186 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 102 [2024-11-08 17:57:11,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:11,189 INFO L225 Difference]: With dead ends: 1215 [2024-11-08 17:57:11,189 INFO L226 Difference]: Without dead ends: 748 [2024-11-08 17:57:11,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:57:11,191 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 218 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:11,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1091 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:57:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2024-11-08 17:57:11,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 554. [2024-11-08 17:57:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 521 states have (on average 1.418426103646833) internal successors, (739), 521 states have internal predecessors, (739), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:57:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 793 transitions. [2024-11-08 17:57:11,240 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 793 transitions. Word has length 102 [2024-11-08 17:57:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:11,241 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 793 transitions. [2024-11-08 17:57:11,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 793 transitions. [2024-11-08 17:57:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 17:57:11,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:11,243 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:11,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 17:57:11,243 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:11,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:11,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2023231102, now seen corresponding path program 1 times [2024-11-08 17:57:11,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:11,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224251278] [2024-11-08 17:57:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:11,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:11,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:11,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:11,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:11,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:11,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:11,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:11,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:11,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:11,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:11,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:11,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224251278] [2024-11-08 17:57:11,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224251278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:11,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:11,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:57:11,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539836943] [2024-11-08 17:57:11,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:11,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:57:11,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:11,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:57:11,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:57:11,532 INFO L87 Difference]: Start difference. First operand 554 states and 793 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:11,866 INFO L93 Difference]: Finished difference Result 1024 states and 1458 transitions. [2024-11-08 17:57:11,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:57:11,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2024-11-08 17:57:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:11,870 INFO L225 Difference]: With dead ends: 1024 [2024-11-08 17:57:11,870 INFO L226 Difference]: Without dead ends: 721 [2024-11-08 17:57:11,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:57:11,871 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 235 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:11,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 517 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:57:11,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-08 17:57:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 554. [2024-11-08 17:57:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 521 states have (on average 1.416506717850288) internal successors, (738), 521 states have internal predecessors, (738), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:57:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 792 transitions. [2024-11-08 17:57:11,923 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 792 transitions. Word has length 102 [2024-11-08 17:57:11,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:11,923 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 792 transitions. [2024-11-08 17:57:11,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:11,923 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 792 transitions. [2024-11-08 17:57:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 17:57:11,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:11,925 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:11,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 17:57:11,925 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:11,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:11,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1861660788, now seen corresponding path program 1 times [2024-11-08 17:57:11,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:11,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293904818] [2024-11-08 17:57:11,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:11,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:12,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:12,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:12,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:12,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:12,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:12,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:12,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:12,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:12,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:12,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:12,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293904818] [2024-11-08 17:57:12,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293904818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:12,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:12,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:57:12,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9605541] [2024-11-08 17:57:12,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:12,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:57:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:12,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:57:12,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:57:12,781 INFO L87 Difference]: Start difference. First operand 554 states and 792 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:13,878 INFO L93 Difference]: Finished difference Result 1219 states and 1731 transitions. [2024-11-08 17:57:13,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:57:13,878 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 102 [2024-11-08 17:57:13,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:13,881 INFO L225 Difference]: With dead ends: 1219 [2024-11-08 17:57:13,881 INFO L226 Difference]: Without dead ends: 701 [2024-11-08 17:57:13,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2024-11-08 17:57:13,883 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 636 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:13,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1022 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 17:57:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-08 17:57:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 563. [2024-11-08 17:57:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 530 states have (on average 1.4037735849056603) internal successors, (744), 530 states have internal predecessors, (744), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:57:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 798 transitions. [2024-11-08 17:57:13,933 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 798 transitions. Word has length 102 [2024-11-08 17:57:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:13,933 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 798 transitions. [2024-11-08 17:57:13,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 798 transitions. [2024-11-08 17:57:13,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 17:57:13,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:13,934 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:13,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 17:57:13,935 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:13,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:13,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1156051598, now seen corresponding path program 1 times [2024-11-08 17:57:13,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:13,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355942212] [2024-11-08 17:57:13,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:13,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:14,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:14,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:14,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:14,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:14,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:14,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:14,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:14,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:14,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355942212] [2024-11-08 17:57:14,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355942212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:14,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:14,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 17:57:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498443927] [2024-11-08 17:57:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:14,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:57:14,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:14,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:57:14,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:57:14,645 INFO L87 Difference]: Start difference. First operand 563 states and 798 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:15,657 INFO L93 Difference]: Finished difference Result 954 states and 1360 transitions. [2024-11-08 17:57:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:57:15,658 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 103 [2024-11-08 17:57:15,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:15,661 INFO L225 Difference]: With dead ends: 954 [2024-11-08 17:57:15,661 INFO L226 Difference]: Without dead ends: 645 [2024-11-08 17:57:15,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:57:15,662 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 221 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:15,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 845 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 17:57:15,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-11-08 17:57:15,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 586. [2024-11-08 17:57:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 553 states have (on average 1.423146473779385) internal successors, (787), 553 states have internal predecessors, (787), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-08 17:57:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 841 transitions. [2024-11-08 17:57:15,715 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 841 transitions. Word has length 103 [2024-11-08 17:57:15,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:15,716 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 841 transitions. [2024-11-08 17:57:15,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:15,716 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 841 transitions. [2024-11-08 17:57:15,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 17:57:15,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:15,717 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:15,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 17:57:15,717 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:15,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:15,718 INFO L85 PathProgramCache]: Analyzing trace with hash -123812080, now seen corresponding path program 1 times [2024-11-08 17:57:15,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:15,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655539408] [2024-11-08 17:57:15,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:15,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:17,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:17,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:17,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:17,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:17,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:17,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:17,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:17,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:17,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:17,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:17,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655539408] [2024-11-08 17:57:17,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655539408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:17,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:17,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:57:17,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662676062] [2024-11-08 17:57:17,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:17,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:57:17,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:17,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:57:17,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:57:17,679 INFO L87 Difference]: Start difference. First operand 586 states and 841 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 17:57:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:18,248 INFO L93 Difference]: Finished difference Result 1308 states and 1883 transitions. [2024-11-08 17:57:18,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:57:18,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2024-11-08 17:57:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:18,252 INFO L225 Difference]: With dead ends: 1308 [2024-11-08 17:57:18,252 INFO L226 Difference]: Without dead ends: 776 [2024-11-08 17:57:18,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:57:18,254 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 217 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:18,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 499 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:57:18,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-11-08 17:57:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 774. [2024-11-08 17:57:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 731 states have (on average 1.414500683994528) internal successors, (1034), 731 states have internal predecessors, (1034), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:57:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1106 transitions. [2024-11-08 17:57:18,327 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1106 transitions. Word has length 103 [2024-11-08 17:57:18,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:18,328 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1106 transitions. [2024-11-08 17:57:18,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 17:57:18,328 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1106 transitions. [2024-11-08 17:57:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 17:57:18,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:18,329 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:18,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 17:57:18,330 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:18,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:18,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1543781076, now seen corresponding path program 1 times [2024-11-08 17:57:18,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:18,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556169692] [2024-11-08 17:57:18,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:18,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:19,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:19,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:19,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:19,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:19,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:19,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:19,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:19,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:19,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:19,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556169692] [2024-11-08 17:57:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556169692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:19,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 17:57:19,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643026408] [2024-11-08 17:57:19,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:19,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:57:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:19,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:57:19,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:57:19,103 INFO L87 Difference]: Start difference. First operand 774 states and 1106 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:20,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:20,110 INFO L93 Difference]: Finished difference Result 1970 states and 2797 transitions. [2024-11-08 17:57:20,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:57:20,111 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 103 [2024-11-08 17:57:20,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:20,114 INFO L225 Difference]: With dead ends: 1970 [2024-11-08 17:57:20,114 INFO L226 Difference]: Without dead ends: 1250 [2024-11-08 17:57:20,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:57:20,116 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 553 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:20,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 965 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:57:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-08 17:57:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 758. [2024-11-08 17:57:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 715 states have (on average 1.406993006993007) internal successors, (1006), 715 states have internal predecessors, (1006), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:57:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1078 transitions. [2024-11-08 17:57:20,194 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1078 transitions. Word has length 103 [2024-11-08 17:57:20,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:20,194 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1078 transitions. [2024-11-08 17:57:20,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1078 transitions. [2024-11-08 17:57:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 17:57:20,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:20,196 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:20,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 17:57:20,196 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:20,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:20,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1684499158, now seen corresponding path program 1 times [2024-11-08 17:57:20,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:20,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38732074] [2024-11-08 17:57:20,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:20,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:20,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:20,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:20,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:20,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:20,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:20,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:20,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:20,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:20,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:20,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38732074] [2024-11-08 17:57:20,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38732074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:20,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:20,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:57:20,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486026732] [2024-11-08 17:57:20,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:20,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:57:20,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:20,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:57:20,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:57:20,814 INFO L87 Difference]: Start difference. First operand 758 states and 1078 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:22,097 INFO L93 Difference]: Finished difference Result 1768 states and 2528 transitions. [2024-11-08 17:57:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:57:22,098 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 103 [2024-11-08 17:57:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:22,102 INFO L225 Difference]: With dead ends: 1768 [2024-11-08 17:57:22,102 INFO L226 Difference]: Without dead ends: 1064 [2024-11-08 17:57:22,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:57:22,104 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 213 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:22,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1091 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:57:22,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2024-11-08 17:57:22,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 768. [2024-11-08 17:57:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 725 states have (on average 1.4206896551724137) internal successors, (1030), 725 states have internal predecessors, (1030), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:57:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1102 transitions. [2024-11-08 17:57:22,218 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1102 transitions. Word has length 103 [2024-11-08 17:57:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:22,218 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1102 transitions. [2024-11-08 17:57:22,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1102 transitions. [2024-11-08 17:57:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 17:57:22,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:22,220 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:22,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 17:57:22,221 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:22,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:22,221 INFO L85 PathProgramCache]: Analyzing trace with hash -771090059, now seen corresponding path program 1 times [2024-11-08 17:57:22,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:22,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506717946] [2024-11-08 17:57:22,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:22,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:23,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:23,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:23,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:23,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:23,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:23,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:23,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:23,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:23,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:23,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:23,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506717946] [2024-11-08 17:57:23,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506717946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:23,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:23,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:57:23,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927824751] [2024-11-08 17:57:23,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:23,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:57:23,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:23,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:57:23,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:57:23,063 INFO L87 Difference]: Start difference. First operand 768 states and 1102 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:24,569 INFO L93 Difference]: Finished difference Result 1835 states and 2599 transitions. [2024-11-08 17:57:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 17:57:24,569 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2024-11-08 17:57:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:24,573 INFO L225 Difference]: With dead ends: 1835 [2024-11-08 17:57:24,573 INFO L226 Difference]: Without dead ends: 1097 [2024-11-08 17:57:24,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2024-11-08 17:57:24,576 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 623 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:24,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1324 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:57:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-08 17:57:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 742. [2024-11-08 17:57:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 699 states have (on average 1.4120171673819744) internal successors, (987), 699 states have internal predecessors, (987), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:57:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1059 transitions. [2024-11-08 17:57:24,654 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1059 transitions. Word has length 103 [2024-11-08 17:57:24,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:24,655 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1059 transitions. [2024-11-08 17:57:24,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1059 transitions. [2024-11-08 17:57:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 17:57:24,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:24,656 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:24,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 17:57:24,656 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:24,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:24,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1407564245, now seen corresponding path program 1 times [2024-11-08 17:57:24,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:24,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113089954] [2024-11-08 17:57:24,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:24,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:24,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:24,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:24,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:24,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:24,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:24,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113089954] [2024-11-08 17:57:24,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113089954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:24,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:24,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:57:24,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782935214] [2024-11-08 17:57:24,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:24,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:57:24,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:24,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:57:24,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:57:24,835 INFO L87 Difference]: Start difference. First operand 742 states and 1059 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:24,916 INFO L93 Difference]: Finished difference Result 1439 states and 2061 transitions. [2024-11-08 17:57:24,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:57:24,917 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2024-11-08 17:57:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:24,920 INFO L225 Difference]: With dead ends: 1439 [2024-11-08 17:57:24,920 INFO L226 Difference]: Without dead ends: 751 [2024-11-08 17:57:24,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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 17:57:24,922 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 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 17:57:24,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:57:24,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-11-08 17:57:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2024-11-08 17:57:24,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 708 states have (on average 1.4067796610169492) internal successors, (996), 708 states have internal predecessors, (996), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:57:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1068 transitions. [2024-11-08 17:57:24,988 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1068 transitions. Word has length 104 [2024-11-08 17:57:24,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:24,989 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1068 transitions. [2024-11-08 17:57:24,989 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:24,989 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1068 transitions. [2024-11-08 17:57:24,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 17:57:24,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:24,990 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:24,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 17:57:24,991 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:24,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:24,991 INFO L85 PathProgramCache]: Analyzing trace with hash 895756279, now seen corresponding path program 1 times [2024-11-08 17:57:24,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:24,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452851549] [2024-11-08 17:57:24,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:24,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:25,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:25,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:25,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:25,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:25,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:25,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:25,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:25,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:25,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:25,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452851549] [2024-11-08 17:57:25,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452851549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:25,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:25,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:57:25,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032544579] [2024-11-08 17:57:25,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:25,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:57:25,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:25,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:57:25,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:57:25,823 INFO L87 Difference]: Start difference. First operand 751 states and 1068 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:26,397 INFO L93 Difference]: Finished difference Result 1352 states and 1935 transitions. [2024-11-08 17:57:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:57:26,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2024-11-08 17:57:26,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:26,400 INFO L225 Difference]: With dead ends: 1352 [2024-11-08 17:57:26,400 INFO L226 Difference]: Without dead ends: 655 [2024-11-08 17:57:26,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:57:26,401 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 119 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:26,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 495 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:57:26,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-11-08 17:57:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2024-11-08 17:57:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 612 states have (on average 1.3986928104575163) internal successors, (856), 612 states have internal predecessors, (856), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:57:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 928 transitions. [2024-11-08 17:57:26,491 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 928 transitions. Word has length 104 [2024-11-08 17:57:26,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:26,491 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 928 transitions. [2024-11-08 17:57:26,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 928 transitions. [2024-11-08 17:57:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 17:57:26,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:26,494 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:26,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 17:57:26,494 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:26,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:26,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2057307725, now seen corresponding path program 1 times [2024-11-08 17:57:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:26,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891176489] [2024-11-08 17:57:26,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:26,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:27,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:27,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:27,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:27,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:27,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:27,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:27,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:27,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:27,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:27,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:27,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891176489] [2024-11-08 17:57:27,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891176489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:27,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:27,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:57:27,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28917241] [2024-11-08 17:57:27,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:27,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:57:27,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:27,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:57:27,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:57:27,940 INFO L87 Difference]: Start difference. First operand 655 states and 928 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:28,461 INFO L93 Difference]: Finished difference Result 1262 states and 1794 transitions. [2024-11-08 17:57:28,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:57:28,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 104 [2024-11-08 17:57:28,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:28,464 INFO L225 Difference]: With dead ends: 1262 [2024-11-08 17:57:28,464 INFO L226 Difference]: Without dead ends: 661 [2024-11-08 17:57:28,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:57:28,466 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 215 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:28,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 759 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:57:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-08 17:57:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 627. [2024-11-08 17:57:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 584 states have (on average 1.3904109589041096) internal successors, (812), 584 states have internal predecessors, (812), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:57:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 884 transitions. [2024-11-08 17:57:28,535 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 884 transitions. Word has length 104 [2024-11-08 17:57:28,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:28,536 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 884 transitions. [2024-11-08 17:57:28,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 884 transitions. [2024-11-08 17:57:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 17:57:28,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:28,537 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:28,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 17:57:28,538 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:28,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1193557968, now seen corresponding path program 1 times [2024-11-08 17:57:28,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:28,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823902337] [2024-11-08 17:57:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:30,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:30,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:30,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:30,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:30,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:30,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:30,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:30,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:30,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:30,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:30,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823902337] [2024-11-08 17:57:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823902337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:30,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:30,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:57:30,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931657901] [2024-11-08 17:57:30,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:30,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:57:30,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:30,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:57:30,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:57:30,556 INFO L87 Difference]: Start difference. First operand 627 states and 884 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:31,077 INFO L93 Difference]: Finished difference Result 1065 states and 1511 transitions. [2024-11-08 17:57:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:57:31,077 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 104 [2024-11-08 17:57:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:31,080 INFO L225 Difference]: With dead ends: 1065 [2024-11-08 17:57:31,080 INFO L226 Difference]: Without dead ends: 627 [2024-11-08 17:57:31,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:57:31,082 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 305 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:31,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 480 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:57:31,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-08 17:57:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 588. [2024-11-08 17:57:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 545 states have (on average 1.3761467889908257) internal successors, (750), 545 states have internal predecessors, (750), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:57:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 822 transitions. [2024-11-08 17:57:31,144 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 822 transitions. Word has length 104 [2024-11-08 17:57:31,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:31,145 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 822 transitions. [2024-11-08 17:57:31,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 822 transitions. [2024-11-08 17:57:31,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 17:57:31,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:31,146 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:31,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 17:57:31,146 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:31,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:31,147 INFO L85 PathProgramCache]: Analyzing trace with hash 323143436, now seen corresponding path program 1 times [2024-11-08 17:57:31,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:31,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191625597] [2024-11-08 17:57:31,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:31,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:31,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:31,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:31,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:31,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:31,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:31,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:31,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:31,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:31,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:31,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:31,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191625597] [2024-11-08 17:57:31,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191625597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:31,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:31,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:57:31,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904784221] [2024-11-08 17:57:31,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:31,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:57:31,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:31,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:57:31,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:57:31,701 INFO L87 Difference]: Start difference. First operand 588 states and 822 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:32,772 INFO L93 Difference]: Finished difference Result 1560 states and 2171 transitions. [2024-11-08 17:57:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:57:32,772 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2024-11-08 17:57:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:32,776 INFO L225 Difference]: With dead ends: 1560 [2024-11-08 17:57:32,776 INFO L226 Difference]: Without dead ends: 1026 [2024-11-08 17:57:32,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-11-08 17:57:32,778 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 331 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:32,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1475 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 17:57:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-11-08 17:57:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 614. [2024-11-08 17:57:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 571 states have (on average 1.38353765323993) internal successors, (790), 571 states have internal predecessors, (790), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:57:32,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 862 transitions. [2024-11-08 17:57:32,850 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 862 transitions. Word has length 104 [2024-11-08 17:57:32,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:32,851 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 862 transitions. [2024-11-08 17:57:32,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:32,851 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 862 transitions. [2024-11-08 17:57:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 17:57:32,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:32,852 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:32,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 17:57:32,853 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:32,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:32,853 INFO L85 PathProgramCache]: Analyzing trace with hash 291247055, now seen corresponding path program 1 times [2024-11-08 17:57:32,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:32,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300718357] [2024-11-08 17:57:32,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:32,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:33,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:33,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:33,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:33,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:33,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:33,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:33,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:33,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:33,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:33,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:33,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300718357] [2024-11-08 17:57:33,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300718357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:33,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:33,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 17:57:33,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980281286] [2024-11-08 17:57:33,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:33,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:57:33,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:33,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:57:33,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:57:33,526 INFO L87 Difference]: Start difference. First operand 614 states and 862 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:34,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:34,428 INFO L93 Difference]: Finished difference Result 1758 states and 2442 transitions. [2024-11-08 17:57:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:57:34,429 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2024-11-08 17:57:34,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:34,432 INFO L225 Difference]: With dead ends: 1758 [2024-11-08 17:57:34,432 INFO L226 Difference]: Without dead ends: 1198 [2024-11-08 17:57:34,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:57:34,434 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 459 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:34,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1113 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:57:34,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-11-08 17:57:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 624. [2024-11-08 17:57:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 581 states have (on average 1.3838209982788297) internal successors, (804), 581 states have internal predecessors, (804), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:57:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 876 transitions. [2024-11-08 17:57:34,507 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 876 transitions. Word has length 105 [2024-11-08 17:57:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:34,508 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 876 transitions. [2024-11-08 17:57:34,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 876 transitions. [2024-11-08 17:57:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 17:57:34,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:34,509 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:34,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 17:57:34,509 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:34,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:34,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1809411719, now seen corresponding path program 1 times [2024-11-08 17:57:34,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:34,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967402228] [2024-11-08 17:57:34,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:34,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:35,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:35,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:35,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:35,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:35,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:35,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:35,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:35,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:35,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:35,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:35,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967402228] [2024-11-08 17:57:35,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967402228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:35,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:35,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 17:57:35,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403718917] [2024-11-08 17:57:35,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:35,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:57:35,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:35,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:57:35,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:57:35,432 INFO L87 Difference]: Start difference. First operand 624 states and 876 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:36,665 INFO L93 Difference]: Finished difference Result 1560 states and 2179 transitions. [2024-11-08 17:57:36,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:57:36,665 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2024-11-08 17:57:36,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:36,669 INFO L225 Difference]: With dead ends: 1560 [2024-11-08 17:57:36,669 INFO L226 Difference]: Without dead ends: 990 [2024-11-08 17:57:36,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-08 17:57:36,671 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 322 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:36,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 948 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 17:57:36,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-11-08 17:57:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 652. [2024-11-08 17:57:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 609 states have (on average 1.3858784893267653) internal successors, (844), 609 states have internal predecessors, (844), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:57:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 916 transitions. [2024-11-08 17:57:36,744 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 916 transitions. Word has length 105 [2024-11-08 17:57:36,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:36,745 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 916 transitions. [2024-11-08 17:57:36,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:36,745 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 916 transitions. [2024-11-08 17:57:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 17:57:36,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:36,746 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:36,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 17:57:36,747 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:36,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:36,747 INFO L85 PathProgramCache]: Analyzing trace with hash 403670467, now seen corresponding path program 1 times [2024-11-08 17:57:36,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:36,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520532651] [2024-11-08 17:57:36,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:37,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:37,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:37,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:37,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:37,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:37,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:37,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:37,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:37,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:37,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:37,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520532651] [2024-11-08 17:57:37,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520532651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:37,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:37,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:57:37,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148295865] [2024-11-08 17:57:37,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:37,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:57:37,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:37,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:57:37,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:57:37,162 INFO L87 Difference]: Start difference. First operand 652 states and 916 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:37,776 INFO L93 Difference]: Finished difference Result 1229 states and 1731 transitions. [2024-11-08 17:57:37,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:57:37,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2024-11-08 17:57:37,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:37,780 INFO L225 Difference]: With dead ends: 1229 [2024-11-08 17:57:37,780 INFO L226 Difference]: Without dead ends: 781 [2024-11-08 17:57:37,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:57:37,781 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 170 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:37,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 847 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:57:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2024-11-08 17:57:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 667. [2024-11-08 17:57:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 624 states have (on average 1.3942307692307692) internal successors, (870), 624 states have internal predecessors, (870), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:57:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 942 transitions. [2024-11-08 17:57:37,853 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 942 transitions. Word has length 105 [2024-11-08 17:57:37,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:37,853 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 942 transitions. [2024-11-08 17:57:37,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 942 transitions. [2024-11-08 17:57:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 17:57:37,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:37,854 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:37,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 17:57:37,855 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:37,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:37,855 INFO L85 PathProgramCache]: Analyzing trace with hash -876193211, now seen corresponding path program 1 times [2024-11-08 17:57:37,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:37,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512454451] [2024-11-08 17:57:37,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:37,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:39,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:39,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:39,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:39,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:39,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:39,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:39,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:39,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:39,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:39,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:39,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512454451] [2024-11-08 17:57:39,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512454451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:39,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:39,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:57:39,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266305226] [2024-11-08 17:57:39,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:39,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:57:39,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:39,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:57:39,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:57:39,844 INFO L87 Difference]: Start difference. First operand 667 states and 942 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:40,568 INFO L93 Difference]: Finished difference Result 1134 states and 1607 transitions. [2024-11-08 17:57:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:57:40,569 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 105 [2024-11-08 17:57:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:40,572 INFO L225 Difference]: With dead ends: 1134 [2024-11-08 17:57:40,573 INFO L226 Difference]: Without dead ends: 676 [2024-11-08 17:57:40,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:57:40,574 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 207 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:40,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 759 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:57:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-08 17:57:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 665. [2024-11-08 17:57:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 622 states have (on average 1.392282958199357) internal successors, (866), 622 states have internal predecessors, (866), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:57:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 938 transitions. [2024-11-08 17:57:40,642 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 938 transitions. Word has length 105 [2024-11-08 17:57:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:40,642 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 938 transitions. [2024-11-08 17:57:40,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 938 transitions. [2024-11-08 17:57:40,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 17:57:40,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:40,644 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:40,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 17:57:40,644 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:40,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:40,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2133103430, now seen corresponding path program 1 times [2024-11-08 17:57:40,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:40,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362607477] [2024-11-08 17:57:40,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:40,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:40,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:40,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:40,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:40,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:40,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:40,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:40,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:40,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:40,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:40,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362607477] [2024-11-08 17:57:40,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362607477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:40,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:40,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:57:40,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989676972] [2024-11-08 17:57:40,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:40,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:57:40,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:40,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:57:40,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:57:40,762 INFO L87 Difference]: Start difference. First operand 665 states and 938 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:40,828 INFO L93 Difference]: Finished difference Result 1279 states and 1813 transitions. [2024-11-08 17:57:40,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:57:40,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 106 [2024-11-08 17:57:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:40,831 INFO L225 Difference]: With dead ends: 1279 [2024-11-08 17:57:40,831 INFO L226 Difference]: Without dead ends: 668 [2024-11-08 17:57:40,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 17:57:40,833 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 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 17:57:40,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:57:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-08 17:57:40,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2024-11-08 17:57:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 625 states have (on average 1.3904) internal successors, (869), 625 states have internal predecessors, (869), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:57:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 941 transitions. [2024-11-08 17:57:40,903 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 941 transitions. Word has length 106 [2024-11-08 17:57:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:40,903 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 941 transitions. [2024-11-08 17:57:40,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 941 transitions. [2024-11-08 17:57:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 17:57:40,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:40,905 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:40,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-08 17:57:40,905 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:40,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:40,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1557457100, now seen corresponding path program 1 times [2024-11-08 17:57:40,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:40,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337167759] [2024-11-08 17:57:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:40,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:43,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:57:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:43,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:57:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:43,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:57:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:43,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:57:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:43,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:57:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:57:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:43,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:57:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:43,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:57:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:43,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:57:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:43,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:57:43,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337167759] [2024-11-08 17:57:43,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337167759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:43,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:43,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:57:43,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701681813] [2024-11-08 17:57:43,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:43,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:57:43,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:57:43,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:57:43,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:57:43,272 INFO L87 Difference]: Start difference. First operand 668 states and 941 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:44,329 INFO L93 Difference]: Finished difference Result 711 states and 993 transitions. [2024-11-08 17:57:44,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:57:44,330 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 106 [2024-11-08 17:57:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:44,333 INFO L225 Difference]: With dead ends: 711 [2024-11-08 17:57:44,333 INFO L226 Difference]: Without dead ends: 709 [2024-11-08 17:57:44,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2024-11-08 17:57:44,334 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 546 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:57:44,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 790 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:57:44,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-11-08 17:57:44,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 692. [2024-11-08 17:57:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 649 states have (on average 1.3898305084745763) internal successors, (902), 649 states have internal predecessors, (902), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 17:57:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 974 transitions. [2024-11-08 17:57:44,417 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 974 transitions. Word has length 106 [2024-11-08 17:57:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:44,418 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 974 transitions. [2024-11-08 17:57:44,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 974 transitions. [2024-11-08 17:57:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 17:57:44,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:44,419 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:44,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-08 17:57:44,419 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:44,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1559304142, now seen corresponding path program 1 times [2024-11-08 17:57:44,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:57:44,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766452093] [2024-11-08 17:57:44,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:44,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:57:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:57:44,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:57:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:57:44,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:57:44,684 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:57:44,686 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:57:44,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-08 17:57:44,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:57:44,828 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:57:44,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:57:44 BoogieIcfgContainer [2024-11-08 17:57:44,831 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:57:44,832 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:57:44,832 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:57:44,832 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:57:44,833 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:56:38" (3/4) ... [2024-11-08 17:57:44,837 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:57:44,839 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:57:44,841 INFO L158 Benchmark]: Toolchain (without parser) took 68090.32ms. Allocated memory was 155.2MB in the beginning and 866.1MB in the end (delta: 710.9MB). Free memory was 126.5MB in the beginning and 704.6MB in the end (delta: -578.2MB). Peak memory consumption was 133.8MB. Max. memory is 16.1GB. [2024-11-08 17:57:44,842 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 121.6MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:57:44,842 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.49ms. Allocated memory is still 155.2MB. Free memory was 126.5MB in the beginning and 109.8MB in the end (delta: 16.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 17:57:44,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.72ms. Allocated memory is still 155.2MB. Free memory was 109.8MB in the beginning and 105.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:57:44,843 INFO L158 Benchmark]: Boogie Preprocessor took 76.92ms. Allocated memory is still 155.2MB. Free memory was 105.6MB in the beginning and 102.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:57:44,843 INFO L158 Benchmark]: RCFGBuilder took 951.92ms. Allocated memory is still 155.2MB. Free memory was 102.0MB in the beginning and 62.9MB in the end (delta: 39.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-08 17:57:44,843 INFO L158 Benchmark]: TraceAbstraction took 66568.48ms. Allocated memory was 155.2MB in the beginning and 866.1MB in the end (delta: 710.9MB). Free memory was 62.2MB in the beginning and 705.7MB in the end (delta: -643.5MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2024-11-08 17:57:44,843 INFO L158 Benchmark]: Witness Printer took 7.90ms. Allocated memory is still 866.1MB. Free memory was 705.7MB in the beginning and 704.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:57:44,844 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.28ms. Allocated memory is still 121.6MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.49ms. Allocated memory is still 155.2MB. Free memory was 126.5MB in the beginning and 109.8MB in the end (delta: 16.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.72ms. Allocated memory is still 155.2MB. Free memory was 109.8MB in the beginning and 105.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.92ms. Allocated memory is still 155.2MB. Free memory was 105.6MB in the beginning and 102.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 951.92ms. Allocated memory is still 155.2MB. Free memory was 102.0MB in the beginning and 62.9MB in the end (delta: 39.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 66568.48ms. Allocated memory was 155.2MB in the beginning and 866.1MB in the end (delta: 710.9MB). Free memory was 62.2MB in the beginning and 705.7MB in the end (delta: -643.5MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Witness Printer took 7.90ms. Allocated memory is still 866.1MB. Free memory was 705.7MB in the beginning and 704.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 113, overapproximation of someUnaryDOUBLEoperation at line 43. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -10, 4, 200, 32, 256.5, -0.25, 0.30000000000000004, 49.5, -8, 0, 0.4, -256 }; [L51] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] signed short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L53] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L54] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L55] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L56] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L57] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L58] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L59] signed long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L60] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L61] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L62] signed long int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L63] signed long int last_1_WrapperStruct00_var_1_13 = -8; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=0, last_1_WrapperStruct00_var_1_13=-8] [L117] isInitial = 1 [L118] FCALL initially() [L119] COND TRUE 1 [L120] CALL updateLastVariables() [L110] EXPR WrapperStruct00.var_1_13 [L110] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L120] RET updateLastVariables() [L121] CALL updateVariables() [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L94] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L96] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L100] EXPR WrapperStruct00.var_1_10 [L100] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_10 [L100] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L101] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_11 [L102] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_11 [L102] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L103] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_12 [L104] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_12 [L104] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L105] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L107] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L121] RET updateVariables() [L122] CALL step() [L67] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L67] COND FALSE !((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) [L70] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L70] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L71] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_7_Pointer)); [L72] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L72] COND TRUE ! (*(WrapperStruct00_var_1_14_Pointer)) [L73] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L73] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L81] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_11_Pointer)) [L82] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L82] EXPR (*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L82] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L82] signed long int stepLocal_0 = ((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer)); [L83] COND FALSE !(stepLocal_0 < -1) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] (*(WrapperStruct00_var_1_1_Pointer)) = (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L88] EXPR (*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L88] EXPR (*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8, stepLocal_1=200] [L88] COND FALSE !((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) [L122] RET step() [L123] CALL, EXPR property() [L113] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))))) [L113] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1) [L113] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))))) [L113] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))) [L113] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L113] EXPR (! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR ((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer)))) [L113] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L113] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L113] EXPR ((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113] EXPR (((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L113-L114] return (((((((((*(WrapperStruct00_var_1_13_Pointer)) ^ (*(WrapperStruct00_var_1_7_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))) < -1) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (128 - ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_5_Pointer)) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_8_Pointer)) + 1))) : 1)) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_13_Pointer)) & ((*(WrapperStruct00_var_1_7_Pointer)) | (*(WrapperStruct00_var_1_16_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) < 0 ) ? -((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))) : ((*(WrapperStruct00_var_1_10_Pointer)) + ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer)))))))) : 1)) && ((! (*(WrapperStruct00_var_1_14_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_7_Pointer)) > ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_11_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_7_Pointer)))) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:18}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1, last_1_WrapperStruct00_var_1_13=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.4s, OverallIterations: 38, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10473 SdHoareTripleChecker+Valid, 19.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10473 mSDsluCounter, 28285 SdHoareTripleChecker+Invalid, 17.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23122 mSDsCounter, 425 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16098 IncrementalHoareTripleChecker+Invalid, 16523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 425 mSolverCounterUnsat, 5163 mSDtfsCounter, 16098 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1378 GetRequests, 908 SyntacticMatches, 11 SemanticMatches, 459 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=774occurred in iteration=23, InterpolantAutomatonStates: 320, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 37 MinimizatonAttempts, 5206 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 33.3s InterpolantComputationTime, 3962 NumberOfCodeBlocks, 3962 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3818 ConstructedInterpolants, 0 QuantifiedInterpolants, 36447 SizeOfPredicates, 9 NumberOfNonLiveVariables, 442 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 38 InterpolantComputations, 36 PerfectInterpolantSequences, 5374/5472 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 17:57:44,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:57:47,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:57:47,337 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:57:47,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:57:47,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:57:47,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:57:47,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:57:47,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:57:47,401 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:57:47,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:57:47,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:57:47,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:57:47,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:57:47,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:57:47,405 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:57:47,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:57:47,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:57:47,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:57:47,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:57:47,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:57:47,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:57:47,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:57:47,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:57:47,410 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:57:47,410 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:57:47,410 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:57:47,411 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:57:47,411 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:57:47,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:57:47,412 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:57:47,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:57:47,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:57:47,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:57:47,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:57:47,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:57:47,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:57:47,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:57:47,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:57:47,415 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:57:47,415 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:57:47,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:57:47,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:57:47,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:57:47,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:57:47,418 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_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 -> 9fba8bcd82b4a3fe57500a406293d5d51cfc2c8d1877a7a6552e09538ec18fb3 [2024-11-08 17:57:47,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:57:47,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:57:47,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:57:47,801 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:57:47,801 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:57:47,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i Unable to find full path for "g++" [2024-11-08 17:57:49,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:57:50,287 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:57:50,287 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i [2024-11-08 17:57:50,302 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/data/cd9396045/774c109715e54bae95b1157156c00ef9/FLAGc3a339e38 [2024-11-08 17:57:50,320 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/data/cd9396045/774c109715e54bae95b1157156c00ef9 [2024-11-08 17:57:50,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:57:50,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:57:50,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:57:50,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:57:50,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:57:50,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:57:50" (1/1) ... [2024-11-08 17:57:50,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17db21bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:50, skipping insertion in model container [2024-11-08 17:57:50,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:57:50" (1/1) ... [2024-11-08 17:57:50,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:57:50,589 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_04ba324e-f5ff-48e8-8134-cc1cf188a32b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i[917,930] [2024-11-08 17:57:50,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:57:50,757 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:57:50,772 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_04ba324e-f5ff-48e8-8134-cc1cf188a32b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-33.i[917,930] [2024-11-08 17:57:50,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:57:50,867 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:57:50,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:50 WrapperNode [2024-11-08 17:57:50,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:57:50,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:57:50,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:57:50,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:57:50,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:50" (1/1) ... [2024-11-08 17:57:50,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:50" (1/1) ... [2024-11-08 17:57:50,940 INFO L138 Inliner]: procedures = 37, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2024-11-08 17:57:50,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:57:50,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:57:50,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:57:50,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:57:50,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:50" (1/1) ... [2024-11-08 17:57:50,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:50" (1/1) ... [2024-11-08 17:57:50,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:50" (1/1) ... [2024-11-08 17:57:50,989 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 28 writes are split as follows [0, 28]. [2024-11-08 17:57:50,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:50" (1/1) ... [2024-11-08 17:57:50,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:50" (1/1) ... [2024-11-08 17:57:51,022 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:50" (1/1) ... [2024-11-08 17:57:51,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:50" (1/1) ... [2024-11-08 17:57:51,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:50" (1/1) ... [2024-11-08 17:57:51,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:50" (1/1) ... [2024-11-08 17:57:51,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:57:51,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:57:51,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:57:51,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:57:51,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:50" (1/1) ... [2024-11-08 17:57:51,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:57:51,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:57:51,076 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:57:51,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:57:51,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:57:51,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 17:57:51,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 17:57:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:57:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:57:51,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 17:57:51,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 17:57:51,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 17:57:51,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 17:57:51,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 17:57:51,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 17:57:51,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-08 17:57:51,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-08 17:57:51,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 17:57:51,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 17:57:51,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-08 17:57:51,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-08 17:57:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 17:57:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 17:57:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:57:51,118 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:57:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-08 17:57:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-08 17:57:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:57:51,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:57:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 17:57:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 17:57:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 17:57:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 17:57:51,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 17:57:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 17:57:51,304 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:57:51,306 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:57:54,566 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-08 17:57:54,566 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:57:54,582 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:57:54,582 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:57:54,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:57:54 BoogieIcfgContainer [2024-11-08 17:57:54,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:57:54,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:57:54,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:57:54,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:57:54,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:57:50" (1/3) ... [2024-11-08 17:57:54,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ec6719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:57:54, skipping insertion in model container [2024-11-08 17:57:54,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:57:50" (2/3) ... [2024-11-08 17:57:54,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ec6719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:57:54, skipping insertion in model container [2024-11-08 17:57:54,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:57:54" (3/3) ... [2024-11-08 17:57:54,591 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-33.i [2024-11-08 17:57:54,609 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:57:54,610 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:57:54,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:57:54,683 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;@34d93616, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:57:54,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:57:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:57:54,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 17:57:54,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:54,700 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:54,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:54,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:54,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1474510348, now seen corresponding path program 1 times [2024-11-08 17:57:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:57:54,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340640328] [2024-11-08 17:57:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:54,727 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 17:57:54,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:57:54,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:57:54,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:57:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:55,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:57:55,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:57:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 17:57:55,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:57:55,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:57:55,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340640328] [2024-11-08 17:57:55,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340640328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:55,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:55,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:57:55,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568297693] [2024-11-08 17:57:55,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:55,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:57:55,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:57:55,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:57:55,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:57:55,242 INFO L87 Difference]: Start difference. First operand has 85 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:57:55,278 INFO L93 Difference]: Finished difference Result 163 states and 247 transitions. [2024-11-08 17:57:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:57:55,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-08 17:57:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:57:55,289 INFO L225 Difference]: With dead ends: 163 [2024-11-08 17:57:55,289 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 17:57:55,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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 17:57:55,296 INFO L432 NwaCegarLoop]: 115 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, 115 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 17:57:55,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:57:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 17:57:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 17:57:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:57:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-11-08 17:57:55,338 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 92 [2024-11-08 17:57:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:57:55,339 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-11-08 17:57:55,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:57:55,340 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-08 17:57:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 17:57:55,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:57:55,343 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:57:55,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 17:57:55,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:57:55,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:57:55,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:57:55,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1051950606, now seen corresponding path program 1 times [2024-11-08 17:57:55,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:57:55,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13475509] [2024-11-08 17:57:55,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:57:55,550 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 17:57:55,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:57:55,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:57:55,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:57:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:57:55,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:57:55,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:57:56,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 12 treesize of output 8 [2024-11-08 17:57:56,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-08 17:57:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:57:56,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:57:56,151 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:57:56,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13475509] [2024-11-08 17:57:56,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13475509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:57:56,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:57:56,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:57:56,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215560876] [2024-11-08 17:57:56,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:57:56,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:57:56,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:57:56,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:57:56,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:57:56,158 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:57:58,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:58:00,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:58:01,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:58:04,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:58:06,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:58:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:58:06,904 INFO L93 Difference]: Finished difference Result 195 states and 277 transitions. [2024-11-08 17:58:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:58:06,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-08 17:58:06,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:58:06,907 INFO L225 Difference]: With dead ends: 195 [2024-11-08 17:58:06,907 INFO L226 Difference]: Without dead ends: 117 [2024-11-08 17:58:06,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:58:06,909 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 44 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:58:06,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 336 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2024-11-08 17:58:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-08 17:58:06,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 87. [2024-11-08 17:58:06,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:58:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-11-08 17:58:06,920 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 92 [2024-11-08 17:58:06,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:58:06,922 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-11-08 17:58:06,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:58:06,922 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-11-08 17:58:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 17:58:06,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:06,924 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:58:06,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:07,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:07,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:07,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:07,126 INFO L85 PathProgramCache]: Analyzing trace with hash -227913072, now seen corresponding path program 1 times [2024-11-08 17:58:07,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:58:07,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043056909] [2024-11-08 17:58:07,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:07,128 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 17:58:07,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:58:07,131 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:07,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:07,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:58:07,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:58:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:58:07,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:58:07,583 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:58:07,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043056909] [2024-11-08 17:58:07,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043056909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:58:07,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:58:07,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:58:07,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227065858] [2024-11-08 17:58:07,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:58:07,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:58:07,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:58:07,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:58:07,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:58:07,586 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:58:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:58:07,714 INFO L93 Difference]: Finished difference Result 178 states and 253 transitions. [2024-11-08 17:58:07,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:58:07,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-08 17:58:07,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:58:07,716 INFO L225 Difference]: With dead ends: 178 [2024-11-08 17:58:07,716 INFO L226 Difference]: Without dead ends: 94 [2024-11-08 17:58:07,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 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 17:58:07,718 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 519 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 17:58:07,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 519 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:58:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-08 17:58:07,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-08 17:58:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:58:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2024-11-08 17:58:07,730 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 92 [2024-11-08 17:58:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:58:07,731 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2024-11-08 17:58:07,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:58:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2024-11-08 17:58:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 17:58:07,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:07,733 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:58:07,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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)] Ended with exit code 0 [2024-11-08 17:58:07,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:07,941 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:07,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:07,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1547094290, now seen corresponding path program 1 times [2024-11-08 17:58:07,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:58:07,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822552769] [2024-11-08 17:58:07,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:07,943 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 17:58:07,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:58:07,944 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:07,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:08,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:58:08,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:58:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:58:08,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:58:08,449 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:58:08,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822552769] [2024-11-08 17:58:08,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822552769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:58:08,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:58:08,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:58:08,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364613061] [2024-11-08 17:58:08,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:58:08,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:58:08,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:58:08,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:58:08,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:58:08,453 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:58:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:58:08,619 INFO L93 Difference]: Finished difference Result 186 states and 259 transitions. [2024-11-08 17:58:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:58:08,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-08 17:58:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:58:08,622 INFO L225 Difference]: With dead ends: 186 [2024-11-08 17:58:08,622 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 17:58:08,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:58:08,624 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:58:08,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 616 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:58:08,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 17:58:08,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-08 17:58:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:58:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2024-11-08 17:58:08,633 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 92 [2024-11-08 17:58:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:58:08,633 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2024-11-08 17:58:08,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:58:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2024-11-08 17:58:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 17:58:08,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:08,636 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:58:08,645 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:08,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:08,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:08,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:08,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1548941332, now seen corresponding path program 1 times [2024-11-08 17:58:08,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:58:08,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976162522] [2024-11-08 17:58:08,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:08,845 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 17:58:08,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:58:08,848 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:08,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:09,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:58:09,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:58:09,442 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 95 treesize of output 41 [2024-11-08 17:58:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 17:58:09,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:58:09,503 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:58:09,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976162522] [2024-11-08 17:58:09,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976162522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:58:09,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:58:09,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:58:09,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062945851] [2024-11-08 17:58:09,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:58:09,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:58:09,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:58:09,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:58:09,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:58:09,506 INFO L87 Difference]: Start difference. First operand 95 states and 131 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:58:12,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:58:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:58:14,590 INFO L93 Difference]: Finished difference Result 188 states and 260 transitions. [2024-11-08 17:58:14,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:58:14,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-08 17:58:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:58:14,592 INFO L225 Difference]: With dead ends: 188 [2024-11-08 17:58:14,592 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 17:58:14,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:58:14,594 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 89 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:58:14,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 329 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-08 17:58:14,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 17:58:14,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-08 17:58:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 84 states have internal predecessors, (112), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:58:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 130 transitions. [2024-11-08 17:58:14,602 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 130 transitions. Word has length 92 [2024-11-08 17:58:14,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:58:14,603 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 130 transitions. [2024-11-08 17:58:14,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:58:14,603 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 130 transitions. [2024-11-08 17:58:14,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:58:14,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:14,605 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:58:14,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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)] Ended with exit code 0 [2024-11-08 17:58:14,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:14,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:14,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:14,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1148385426, now seen corresponding path program 1 times [2024-11-08 17:58:14,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:58:14,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953290054] [2024-11-08 17:58:14,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:14,812 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 17:58:14,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:58:14,815 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:14,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:15,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:58:15,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:58:15,447 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 95 treesize of output 41 [2024-11-08 17:58:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-08 17:58:15,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:58:15,497 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:58:15,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953290054] [2024-11-08 17:58:15,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953290054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:58:15,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:58:15,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:58:15,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950828588] [2024-11-08 17:58:15,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:58:15,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:58:15,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:58:15,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:58:15,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:58:15,499 INFO L87 Difference]: Start difference. First operand 95 states and 130 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:58:17,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:58:18,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:58:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:58:21,204 INFO L93 Difference]: Finished difference Result 188 states and 258 transitions. [2024-11-08 17:58:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:58:21,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2024-11-08 17:58:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:58:21,206 INFO L225 Difference]: With dead ends: 188 [2024-11-08 17:58:21,206 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 17:58:21,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:58:21,208 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 80 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:58:21,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 325 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-08 17:58:21,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 17:58:21,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-08 17:58:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 84 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:58:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2024-11-08 17:58:21,216 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 94 [2024-11-08 17:58:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:58:21,217 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2024-11-08 17:58:21,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 17:58:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2024-11-08 17:58:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 17:58:21,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:21,219 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:58:21,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:21,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:21,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:21,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1283191084, now seen corresponding path program 1 times [2024-11-08 17:58:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:58:21,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097154547] [2024-11-08 17:58:21,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:21,421 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 17:58:21,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:58:21,424 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:21,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:58:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:21,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 17:58:21,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:58:21,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2024-11-08 17:58:22,106 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 19 [2024-11-08 17:58:22,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 17:58:22,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-08 17:58:23,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-08 17:58:23,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-08 17:58:23,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-08 17:58:24,020 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 29 treesize of output 13 [2024-11-08 17:58:28,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-08 17:58:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 17:58:28,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:58:37,171 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:58:37,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097154547] [2024-11-08 17:58:37,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097154547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:58:37,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112341850] [2024-11-08 17:58:37,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:37,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:58:37,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:58:37,177 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:58:37,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 17:58:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:37,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 17:58:37,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:58:39,417 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-08 17:58:39,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 25 [2024-11-08 17:58:39,801 INFO L349 Elim1Store]: treesize reduction 60, result has 41.7 percent of original size [2024-11-08 17:58:39,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 64 [2024-11-08 17:58:40,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:58:40,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 143 treesize of output 195 [2024-11-08 17:59:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:59:14,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:59:14,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112341850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:59:14,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:59:14,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-11-08 17:59:14,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846620021] [2024-11-08 17:59:14,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:59:14,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:59:14,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:59:14,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:59:14,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=259, Unknown=3, NotChecked=0, Total=306 [2024-11-08 17:59:14,917 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:59:18,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:59:19,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:59:20,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:59:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:59:21,930 INFO L93 Difference]: Finished difference Result 182 states and 248 transitions. [2024-11-08 17:59:21,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:59:21,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-08 17:59:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:59:21,932 INFO L225 Difference]: With dead ends: 182 [2024-11-08 17:59:21,932 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 17:59:21,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=53, Invalid=324, Unknown=3, NotChecked=0, Total=380 [2024-11-08 17:59:21,934 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 61 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:59:21,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 281 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-08 17:59:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 17:59:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-08 17:59:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 78 states have internal predecessors, (102), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:59:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2024-11-08 17:59:21,944 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 96 [2024-11-08 17:59:21,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:59:21,944 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2024-11-08 17:59:21,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:59:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2024-11-08 17:59:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 17:59:21,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:59:21,950 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:21,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 17:59:22,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:59:22,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:59:22,352 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:59:22,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:59:22,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1692271148, now seen corresponding path program 1 times [2024-11-08 17:59:22,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:59:22,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43832137] [2024-11-08 17:59:22,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:59:22,353 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 17:59:22,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:59:22,356 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:59:22,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:59:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:59:22,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 17:59:22,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:59:22,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2024-11-08 17:59:23,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-08 17:59:23,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2024-11-08 17:59:24,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2024-11-08 17:59:24,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2024-11-08 17:59:25,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2024-11-08 17:59:25,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:59:25,413 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 46 treesize of output 51 [2024-11-08 17:59:25,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:59:25,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 50 treesize of output 24 [2024-11-08 17:59:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 17:59:30,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:59:38,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:59:38,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43832137] [2024-11-08 17:59:38,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43832137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:59:38,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868186017] [2024-11-08 17:59:38,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:59:38,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:59:38,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:59:38,654 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:59:38,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 17:59:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:59:38,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 17:59:38,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:59:41,684 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-08 17:59:41,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 25 [2024-11-08 17:59:41,913 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-08 17:59:41,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2024-11-08 17:59:42,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-08 17:59:42,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-08 17:59:42,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:59:42,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2024-11-08 17:59:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 17:59:42,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:59:42,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868186017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:59:42,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:59:42,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2024-11-08 17:59:42,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974899889] [2024-11-08 17:59:42,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:59:42,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:59:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:59:42,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:59:42,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=287, Unknown=3, NotChecked=0, Total=342 [2024-11-08 17:59:42,500 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:59:46,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:59:48,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:59:50,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:59:51,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:59:53,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:59:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:59:53,295 INFO L93 Difference]: Finished difference Result 213 states and 286 transitions. [2024-11-08 17:59:53,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:59:53,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-08 17:59:53,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:59:53,297 INFO L225 Difference]: With dead ends: 213 [2024-11-08 17:59:53,297 INFO L226 Difference]: Without dead ends: 127 [2024-11-08 17:59:53,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=60, Invalid=317, Unknown=3, NotChecked=0, Total=380 [2024-11-08 17:59:53,299 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 139 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:59:53,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 252 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2024-11-08 17:59:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-08 17:59:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2024-11-08 17:59:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 17:59:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2024-11-08 17:59:53,310 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 122 transitions. Word has length 96 [2024-11-08 17:59:53,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:59:53,310 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 122 transitions. [2024-11-08 17:59:53,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 17:59:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2024-11-08 17:59:53,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 17:59:53,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:59:53,312 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:53,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 17:59:53,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-08 17:59:53,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:59:53,713 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:59:53,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:59:53,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1322832470, now seen corresponding path program 1 times [2024-11-08 17:59:53,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:59:53,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632389039] [2024-11-08 17:59:53,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:59:53,714 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 17:59:53,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:59:53,715 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:59:53,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 17:59:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:59:54,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 17:59:54,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:59:54,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:59:54,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-08 17:59:54,253 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 18 [2024-11-08 17:59:54,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-08 17:59:54,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-08 17:59:55,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2024-11-08 17:59:55,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2024-11-08 17:59:55,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2024-11-08 17:59:56,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:59:56,095 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 18:00:00,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:00:00,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 14 [2024-11-08 18:00:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 26 proven. 74 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-08 18:00:07,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:00:24,248 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:00:24,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632389039] [2024-11-08 18:00:24,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632389039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:00:24,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084344769] [2024-11-08 18:00:24,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:00:24,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:00:24,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:00:24,250 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:00:24,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 18:00:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:00:24,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 18:00:24,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:00:24,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:00:24,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:00:24,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2024-11-08 18:00:24,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2024-11-08 18:00:31,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2024-11-08 18:00:32,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2024-11-08 18:00:33,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2024-11-08 18:00:33,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2024-11-08 18:00:34,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:00:34,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 56 [2024-11-08 18:00:34,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:00:34,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 23 [2024-11-08 18:00:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 26 proven. 74 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-08 18:00:34,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:00:43,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084344769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:00:43,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:00:43,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-11-08 18:00:43,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217487735] [2024-11-08 18:00:43,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:00:43,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 18:00:43,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:00:43,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 18:00:43,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=434, Unknown=7, NotChecked=0, Total=552 [2024-11-08 18:00:43,034 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. Second operand has 21 states, 19 states have (on average 5.421052631578948) internal successors, (103), 18 states have internal predecessors, (103), 8 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-08 18:00:49,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:00:53,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:00:57,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:01:00,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:01:05,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:01:08,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s 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 18:01:12,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:01:16,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s 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 18:01:20,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s 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 18:01:24,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s 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 18:01:26,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s 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 18:01:29,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:01:34,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:01:36,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:01:37,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:01:37,807 INFO L93 Difference]: Finished difference Result 285 states and 375 transitions. [2024-11-08 18:01:37,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 18:01:37,808 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.421052631578948) internal successors, (103), 18 states have internal predecessors, (103), 8 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 8 states have call successors, (18) Word has length 96 [2024-11-08 18:01:37,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:01:37,809 INFO L225 Difference]: With dead ends: 285 [2024-11-08 18:01:37,809 INFO L226 Difference]: Without dead ends: 197 [2024-11-08 18:01:37,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 241 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 44.0s TimeCoverageRelationStatistics Valid=281, Invalid=902, Unknown=7, NotChecked=0, Total=1190 [2024-11-08 18:01:37,810 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 128 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 25 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:01:37,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 594 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 537 Invalid, 9 Unknown, 0 Unchecked, 53.3s Time] [2024-11-08 18:01:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-08 18:01:37,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 144. [2024-11-08 18:01:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 120 states have (on average 1.2583333333333333) internal successors, (151), 120 states have internal predecessors, (151), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 18:01:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2024-11-08 18:01:37,842 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 96 [2024-11-08 18:01:37,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:01:37,842 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2024-11-08 18:01:37,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.421052631578948) internal successors, (103), 18 states have internal predecessors, (103), 8 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-08 18:01:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2024-11-08 18:01:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 18:01:37,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:01:37,844 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:01:37,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-08 18:01:38,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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)] Forceful destruction successful, exit code 0 [2024-11-08 18:01:38,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:01:38,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:01:38,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:01:38,246 INFO L85 PathProgramCache]: Analyzing trace with hash -482605864, now seen corresponding path program 1 times [2024-11-08 18:01:38,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:01:38,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410284511] [2024-11-08 18:01:38,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:01:38,246 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 18:01:38,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:01:38,249 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:01:38,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:01:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:01:38,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 18:01:38,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:01:39,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2024-11-08 18:01:39,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:01:39,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 51 [2024-11-08 18:01:39,673 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 18:01:39,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:01:39,673 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:01:39,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410284511] [2024-11-08 18:01:39,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410284511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:01:39,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:01:39,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:01:39,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837040822] [2024-11-08 18:01:39,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:01:39,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:01:39,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:01:39,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:01:39,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:01:39,675 INFO L87 Difference]: Start difference. First operand 144 states and 187 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 18:01:41,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:01:44,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:01:45,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:01:46,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:01:47,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:01:47,700 INFO L93 Difference]: Finished difference Result 266 states and 350 transitions. [2024-11-08 18:01:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:01:47,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-08 18:01:47,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:01:47,702 INFO L225 Difference]: With dead ends: 266 [2024-11-08 18:01:47,702 INFO L226 Difference]: Without dead ends: 178 [2024-11-08 18:01:47,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:01:47,703 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 93 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:01:47,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 325 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2024-11-08 18:01:47,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-08 18:01:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 146. [2024-11-08 18:01:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 122 states have internal predecessors, (153), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 18:01:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2024-11-08 18:01:47,728 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 96 [2024-11-08 18:01:47,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:01:47,729 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2024-11-08 18:01:47,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 18:01:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2024-11-08 18:01:47,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 18:01:47,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:01:47,730 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:01:47,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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)] Forceful destruction successful, exit code 0 [2024-11-08 18:01:47,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:01:47,931 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:01:47,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:01:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash -715542383, now seen corresponding path program 1 times [2024-11-08 18:01:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:01:47,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624576310] [2024-11-08 18:01:47,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:01:47,932 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 18:01:47,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:01:47,933 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:01:47,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:01:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:01:48,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 18:01:48,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:01:52,722 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2024-11-08 18:01:52,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 25 [2024-11-08 18:01:52,951 INFO L349 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2024-11-08 18:01:52,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-08 18:01:53,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-08 18:01:53,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-08 18:01:53,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-08 18:01:53,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:01:53,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2024-11-08 18:01:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 18:01:53,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:01:53,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:01:53,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624576310] [2024-11-08 18:01:53,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624576310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:01:53,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:01:53,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:01:53,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312896712] [2024-11-08 18:01:53,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:01:53,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:01:53,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:01:53,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:01:53,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:01:53,637 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 18:01:58,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:01:59,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:02:01,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:02:03,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:02:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:02:03,625 INFO L93 Difference]: Finished difference Result 236 states and 310 transitions. [2024-11-08 18:02:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:02:03,626 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-08 18:02:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:02:03,627 INFO L225 Difference]: With dead ends: 236 [2024-11-08 18:02:03,627 INFO L226 Difference]: Without dead ends: 146 [2024-11-08 18:02:03,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:02:03,628 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 184 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:02:03,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 224 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2024-11-08 18:02:03,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-08 18:02:03,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-08 18:02:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 122 states have (on average 1.2459016393442623) internal successors, (152), 122 states have internal predecessors, (152), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 18:02:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 188 transitions. [2024-11-08 18:02:03,654 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 188 transitions. Word has length 98 [2024-11-08 18:02:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:02:03,654 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 188 transitions. [2024-11-08 18:02:03,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 18:02:03,654 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 188 transitions. [2024-11-08 18:02:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 18:02:03,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:02:03,655 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:02:03,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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)] Forceful destruction successful, exit code 0 [2024-11-08 18:02:03,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:02:03,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:02:03,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:02:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1995406061, now seen corresponding path program 1 times [2024-11-08 18:02:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:02:03,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399691737] [2024-11-08 18:02:03,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:02:03,857 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 18:02:03,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:02:03,858 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:02:03,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:02:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:02:04,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-08 18:02:04,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:02:06,182 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 18:02:07,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 18:02:08,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 18:02:10,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 18:02:11,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-08 18:02:13,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-08 18:02:13,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2024-11-08 18:02:13,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2024-11-08 18:02:14,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2024-11-08 18:02:15,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 84 [2024-11-08 18:02:15,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:02:15,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 142 treesize of output 82 [2024-11-08 18:02:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 65 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 18:02:15,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:02:46,778 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:02:46,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399691737] [2024-11-08 18:02:46,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399691737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:02:46,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154441353] [2024-11-08 18:02:46,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:02:46,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:02:46,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:02:46,780 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:02:46,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-08 18:02:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:02:47,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-08 18:02:47,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:02:47,113 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 48 treesize of output 47 [2024-11-08 18:02:49,035 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 91 treesize of output 72 [2024-11-08 18:02:53,756 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 91 treesize of output 70 [2024-11-08 18:03:01,263 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 103 treesize of output 80 [2024-11-08 18:03:04,095 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 103 treesize of output 80 [2024-11-08 18:03:06,712 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 103 treesize of output 80 [2024-11-08 18:03:09,182 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 103 treesize of output 80 [2024-11-08 18:03:12,367 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 97 treesize of output 74 [2024-11-08 18:03:13,925 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 74 [2024-11-08 18:03:14,940 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 96 treesize of output 75 [2024-11-08 18:03:16,496 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 96 treesize of output 75 [2024-11-08 18:03:19,233 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 99 treesize of output 75 [2024-11-08 18:03:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 18 proven. 105 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 18:03:19,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:03:46,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154441353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:03:46,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:03:46,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 29 [2024-11-08 18:03:46,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416512876] [2024-11-08 18:03:46,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:03:46,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 18:03:46,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:03:46,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 18:03:46,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1746, Unknown=9, NotChecked=0, Total=1980 [2024-11-08 18:03:46,716 INFO L87 Difference]: Start difference. First operand 146 states and 188 transitions. Second operand has 30 states, 28 states have (on average 4.321428571428571) internal successors, (121), 29 states have internal predecessors, (121), 9 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 18:03:47,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s 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 18:04:52,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:04:54,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:04:58,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:03,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:06,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:09,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:11,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:14,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:18,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:20,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:27,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:32,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:36,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:39,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:40,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:42,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:46,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:47,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:51,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:05:56,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:06:00,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:06:05,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:06:09,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:06:11,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:06:13,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:06:17,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:06:19,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:06:20,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:06:23,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:06:27,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:06:56,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:00,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:03,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:04,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:08,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:12,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:16,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:21,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:23,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:32,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:35,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:37,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:41,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:45,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:48,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:50,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:53,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:07:55,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:08:00,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:08:03,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:08:05,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:08:08,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:08:09,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:08:12,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:08:16,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:08:20,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:08:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:08:33,591 INFO L93 Difference]: Finished difference Result 407 states and 511 transitions. [2024-11-08 18:08:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-08 18:08:33,593 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 4.321428571428571) internal successors, (121), 29 states have internal predecessors, (121), 9 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) Word has length 98 [2024-11-08 18:08:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:08:33,595 INFO L225 Difference]: With dead ends: 407 [2024-11-08 18:08:33,595 INFO L226 Difference]: Without dead ends: 317 [2024-11-08 18:08:33,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2320 ImplicationChecksByTransitivity, 117.4s TimeCoverageRelationStatistics Valid=1189, Invalid=7358, Unknown=9, NotChecked=0, Total=8556 [2024-11-08 18:08:33,598 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 660 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 145 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 244.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 247.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:08:33,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1252 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2057 Invalid, 23 Unknown, 0 Unchecked, 247.8s Time] [2024-11-08 18:08:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-08 18:08:33,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 174. [2024-11-08 18:08:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 146 states have (on average 1.226027397260274) internal successors, (179), 146 states have internal predecessors, (179), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 18:08:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 215 transitions. [2024-11-08 18:08:33,648 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 215 transitions. Word has length 98 [2024-11-08 18:08:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:08:33,648 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 215 transitions. [2024-11-08 18:08:33,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 4.321428571428571) internal successors, (121), 29 states have internal predecessors, (121), 9 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (18), 7 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-08 18:08:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2024-11-08 18:08:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 18:08:33,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:08:33,650 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:08:33,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-08 18:08:33,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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)] Forceful destruction successful, exit code 0 [2024-11-08 18:08:34,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:08:34,051 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:08:34,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:08:34,051 INFO L85 PathProgramCache]: Analyzing trace with hash 419996915, now seen corresponding path program 1 times [2024-11-08 18:08:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:08:34,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780882897] [2024-11-08 18:08:34,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:08:34,052 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 18:08:34,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:08:34,053 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:08:34,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:08:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:08:34,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 18:08:34,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:08:34,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:08:34,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2024-11-08 18:08:35,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-08 18:08:38,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-11-08 18:08:40,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-11-08 18:08:41,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-11-08 18:08:44,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-11-08 18:08:46,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2024-11-08 18:08:48,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-08 18:08:48,660 INFO L349 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2024-11-08 18:08:48,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 56 [2024-11-08 18:08:48,977 INFO L349 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2024-11-08 18:08:48,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 55 [2024-11-08 18:08:49,249 INFO L349 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2024-11-08 18:08:49,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 60 [2024-11-08 18:08:49,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:08:49,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 61 [2024-11-08 18:08:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 18:08:50,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:09:08,988 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:09:08,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780882897] [2024-11-08 18:09:08,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780882897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:09:08,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748923663] [2024-11-08 18:09:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:08,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:09:08,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:09:08,989 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:09:08,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-08 18:09:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:09,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 18:09:09,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:09:09,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:09:09,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:09:09,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2024-11-08 18:09:09,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-08 18:09:16,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-08 18:09:16,841 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-08 18:09:16,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2024-11-08 18:09:17,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-08 18:09:17,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:09:17,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-08 18:09:17,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:09:17,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2024-11-08 18:09:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 18:09:22,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:09:22,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748923663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:22,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:09:22,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2024-11-08 18:09:22,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730661891] [2024-11-08 18:09:22,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:22,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 18:09:22,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:09:22,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 18:09:22,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=719, Unknown=6, NotChecked=0, Total=870 [2024-11-08 18:09:22,437 INFO L87 Difference]: Start difference. First operand 174 states and 215 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 18:09:33,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:09:35,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:09:37,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:09:39,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:09:42,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:09:44,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:09:45,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:09:47,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:09:49,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:09:53,636 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 18:09:55,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:09:57,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:09:58,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:09:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:59,116 INFO L93 Difference]: Finished difference Result 402 states and 505 transitions. [2024-11-08 18:09:59,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:09:59,117 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-08 18:09:59,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:59,118 INFO L225 Difference]: With dead ends: 402 [2024-11-08 18:09:59,119 INFO L226 Difference]: Without dead ends: 294 [2024-11-08 18:09:59,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 191 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=203, Invalid=981, Unknown=6, NotChecked=0, Total=1190 [2024-11-08 18:09:59,120 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 408 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 45 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:59,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 438 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 471 Invalid, 4 Unknown, 0 Unchecked, 35.6s Time] [2024-11-08 18:09:59,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-08 18:09:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 184. [2024-11-08 18:09:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 156 states have (on average 1.2243589743589745) internal successors, (191), 156 states have internal predecessors, (191), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 18:09:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 227 transitions. [2024-11-08 18:09:59,172 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 227 transitions. Word has length 98 [2024-11-08 18:09:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:59,173 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 227 transitions. [2024-11-08 18:09:59,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 18:09:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 227 transitions. [2024-11-08 18:09:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 18:09:59,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:59,174 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:09:59,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-08 18:09:59,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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)] Forceful destruction successful, exit code 0 [2024-11-08 18:09:59,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:09:59,575 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:59,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:59,575 INFO L85 PathProgramCache]: Analyzing trace with hash -591120335, now seen corresponding path program 1 times [2024-11-08 18:09:59,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:09:59,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370670034] [2024-11-08 18:09:59,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:59,576 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 18:09:59,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:09:59,577 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:09:59,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 (20)] Waiting until timeout for monitored process [2024-11-08 18:09:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:59,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:09:59,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:09:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 18:09:59,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:09:59,971 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:09:59,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370670034] [2024-11-08 18:09:59,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370670034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:59,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:59,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:09:59,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93671860] [2024-11-08 18:09:59,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:59,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:09:59,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:09:59,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:09:59,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:09:59,973 INFO L87 Difference]: Start difference. First operand 184 states and 227 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 18:10:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:00,091 INFO L93 Difference]: Finished difference Result 295 states and 368 transitions. [2024-11-08 18:10:00,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:10:00,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-08 18:10:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:00,093 INFO L225 Difference]: With dead ends: 295 [2024-11-08 18:10:00,093 INFO L226 Difference]: Without dead ends: 187 [2024-11-08 18:10:00,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 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 18:10:00,094 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:00,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-08 18:10:00,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-08 18:10:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 159 states have (on average 1.220125786163522) internal successors, (194), 159 states have internal predecessors, (194), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 18:10:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 230 transitions. [2024-11-08 18:10:00,145 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 230 transitions. Word has length 98 [2024-11-08 18:10:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:00,145 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 230 transitions. [2024-11-08 18:10:00,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 18:10:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 230 transitions. [2024-11-08 18:10:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 18:10:00,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:00,147 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:00,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 (20)] Ended with exit code 0 [2024-11-08 18:10:00,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:10:00,347 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:00,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash 718425986, now seen corresponding path program 1 times [2024-11-08 18:10:00,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:10:00,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976270190] [2024-11-08 18:10:00,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:00,349 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 18:10:00,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:10:00,350 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:10:00,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 (21)] Waiting until timeout for monitored process [2024-11-08 18:10:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:00,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 18:10:00,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:00,801 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 25 treesize of output 13 [2024-11-08 18:10:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 18:10:00,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:10:00,864 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:10:00,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976270190] [2024-11-08 18:10:00,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976270190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:00,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:00,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:10:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737081612] [2024-11-08 18:10:00,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:00,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:10:00,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:10:00,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:10:00,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:00,866 INFO L87 Difference]: Start difference. First operand 187 states and 230 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 18:10:03,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:10:04,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:10:05,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:10:07,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:10:07,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:07,246 INFO L93 Difference]: Finished difference Result 307 states and 380 transitions. [2024-11-08 18:10:07,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:07,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-08 18:10:07,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:07,248 INFO L225 Difference]: With dead ends: 307 [2024-11-08 18:10:07,249 INFO L226 Difference]: Without dead ends: 187 [2024-11-08 18:10:07,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:07,250 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:07,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 273 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-08 18:10:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-08 18:10:07,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-08 18:10:07,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 159 states have (on average 1.2075471698113207) internal successors, (192), 159 states have internal predecessors, (192), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 18:10:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 228 transitions. [2024-11-08 18:10:07,315 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 228 transitions. Word has length 99 [2024-11-08 18:10:07,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:07,315 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 228 transitions. [2024-11-08 18:10:07,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 18:10:07,316 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 228 transitions. [2024-11-08 18:10:07,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 18:10:07,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:07,317 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:10:07,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 (21)] Forceful destruction successful, exit code 0 [2024-11-08 18:10:07,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:10:07,518 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:07,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:07,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1087012348, now seen corresponding path program 1 times [2024-11-08 18:10:07,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:10:07,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286385074] [2024-11-08 18:10:07,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:07,519 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 18:10:07,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:10:07,521 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 18:10:07,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/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 (22)] Waiting until timeout for monitored process [2024-11-08 18:10:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:08,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-08 18:10:08,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:08,160 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 46 treesize of output 45 [2024-11-08 18:10:09,662 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 90 treesize of output 69 [2024-11-08 18:10:11,871 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 87 treesize of output 68 [2024-11-08 18:10:14,157 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 90 treesize of output 71 [2024-11-08 18:10:15,649 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 90 treesize of output 71 [2024-11-08 18:10:17,395 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 90 treesize of output 71 [2024-11-08 18:10:19,279 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 90 treesize of output 71 [2024-11-08 18:10:21,610 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 72 [2024-11-08 18:10:22,173 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 73 [2024-11-08 18:10:22,767 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 76 [2024-11-08 18:10:23,440 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 83 [2024-11-08 18:10:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-08 18:10:24,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:10:47,253 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:10:47,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286385074] [2024-11-08 18:10:47,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286385074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:10:47,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015299768] [2024-11-08 18:10:47,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:47,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:47,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:10:47,255 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:10:47,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04ba324e-f5ff-48e8-8134-cc1cf188a32b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-08 18:10:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:47,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-08 18:10:47,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:47,652 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 48 treesize of output 47 [2024-11-08 18:10:49,474 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 91 treesize of output 72