./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/lockfree-3.0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/lockfree-3.0.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce7b97696e85da66033a1f3711f1d24681434c76600ae3cd891d7ea07b7fcbea --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 15:52:59,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:52:59,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:52:59,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:52:59,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:52:59,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:52:59,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:52:59,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:52:59,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:52:59,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:52:59,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:52:59,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:52:59,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:52:59,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:52:59,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:52:59,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:52:59,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:52:59,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:52:59,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:52:59,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:52:59,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:52:59,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:52:59,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:52:59,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:52:59,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:52:59,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:52:59,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:52:59,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:52:59,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:52:59,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:52:59,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:52:59,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:52:59,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:52:59,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:52:59,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:52:59,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:52:59,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:52:59,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:52:59,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:52:59,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:52:59,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:52:59,201 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 15:52:59,216 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:52:59,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:52:59,216 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:52:59,216 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:52:59,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:52:59,217 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:52:59,217 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:52:59,217 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:52:59,217 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:52:59,217 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:52:59,217 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:52:59,217 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:52:59,217 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:52:59,217 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:52:59,217 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:52:59,217 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:52:59,218 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:52:59,218 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:52:59,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 15:52:59,218 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 15:52:59,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:52:59,218 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:52:59,218 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:52:59,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:52:59,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:52:59,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:52:59,219 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 15:52:59,219 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 15:52:59,219 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 15:52:59,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:52:59,219 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 15:52:59,219 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:52:59,219 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:52:59,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:52:59,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:52:59,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:52:59,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:52:59,220 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:52:59,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:52:59,221 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:52:59,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:52:59,221 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:52:59,221 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/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_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> ce7b97696e85da66033a1f3711f1d24681434c76600ae3cd891d7ea07b7fcbea [2022-12-14 15:52:59,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:52:59,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:52:59,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:52:59,410 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:52:59,411 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:52:59,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/memsafety/lockfree-3.0.i [2022-12-14 15:53:02,014 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:53:02,168 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:53:02,169 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/sv-benchmarks/c/memsafety/lockfree-3.0.i [2022-12-14 15:53:02,176 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/data/3fcc2735c/6f6186fb33354b9f9f8fc7ca4c7c792d/FLAG35df3335e [2022-12-14 15:53:02,187 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/data/3fcc2735c/6f6186fb33354b9f9f8fc7ca4c7c792d [2022-12-14 15:53:02,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:53:02,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:53:02,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:53:02,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:53:02,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:53:02,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:53:02" (1/1) ... [2022-12-14 15:53:02,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69865c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:02, skipping insertion in model container [2022-12-14 15:53:02,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:53:02" (1/1) ... [2022-12-14 15:53:02,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:53:02,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:53:02,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:53:02,411 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:53:02,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:53:02,457 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:53:02,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:02 WrapperNode [2022-12-14 15:53:02,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:53:02,458 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:53:02,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:53:02,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:53:02,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:02" (1/1) ... [2022-12-14 15:53:02,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:02" (1/1) ... [2022-12-14 15:53:02,486 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2022-12-14 15:53:02,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:53:02,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:53:02,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:53:02,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:53:02,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:02" (1/1) ... [2022-12-14 15:53:02,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:02" (1/1) ... [2022-12-14 15:53:02,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:02" (1/1) ... [2022-12-14 15:53:02,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:02" (1/1) ... [2022-12-14 15:53:02,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:02" (1/1) ... [2022-12-14 15:53:02,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:02" (1/1) ... [2022-12-14 15:53:02,504 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:02" (1/1) ... [2022-12-14 15:53:02,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:02" (1/1) ... [2022-12-14 15:53:02,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:53:02,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:53:02,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:53:02,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:53:02,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:02" (1/1) ... [2022-12-14 15:53:02,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:53:02,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:02,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:53:02,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:53:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 15:53:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 15:53:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 15:53:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:53:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 15:53:02,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 15:53:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:53:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 15:53:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:53:02,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:53:02,642 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:53:02,644 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:53:02,867 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:53:02,935 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:53:02,936 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 15:53:02,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:53:02 BoogieIcfgContainer [2022-12-14 15:53:02,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:53:02,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:53:02,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:53:02,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:53:02,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:53:02" (1/3) ... [2022-12-14 15:53:02,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775c3289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:53:02, skipping insertion in model container [2022-12-14 15:53:02,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:02" (2/3) ... [2022-12-14 15:53:02,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775c3289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:53:02, skipping insertion in model container [2022-12-14 15:53:02,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:53:02" (3/3) ... [2022-12-14 15:53:02,947 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.0.i [2022-12-14 15:53:02,967 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:53:02,967 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-12-14 15:53:03,004 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:53:03,008 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@3d82c772, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:53:03,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-12-14 15:53:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 15:53:03,016 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:03,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 15:53:03,017 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:03,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:03,021 INFO L85 PathProgramCache]: Analyzing trace with hash 5940810, now seen corresponding path program 1 times [2022-12-14 15:53:03,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:03,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076947766] [2022-12-14 15:53:03,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:03,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:03,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:03,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076947766] [2022-12-14 15:53:03,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076947766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:03,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:03,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:53:03,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384107412] [2022-12-14 15:53:03,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:03,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 15:53:03,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:03,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 15:53:03,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 15:53:03,192 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:03,232 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-12-14 15:53:03,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 15:53:03,234 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 15:53:03,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:03,243 INFO L225 Difference]: With dead ends: 49 [2022-12-14 15:53:03,243 INFO L226 Difference]: Without dead ends: 48 [2022-12-14 15:53:03,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 15:53:03,248 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:03,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-12-14 15:53:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-12-14 15:53:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 2.107142857142857) internal successors, (59), 47 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2022-12-14 15:53:03,280 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 4 [2022-12-14 15:53:03,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:03,281 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-12-14 15:53:03,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-12-14 15:53:03,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 15:53:03,282 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:03,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 15:53:03,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 15:53:03,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:03,283 INFO L85 PathProgramCache]: Analyzing trace with hash 185350861, now seen corresponding path program 1 times [2022-12-14 15:53:03,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:03,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748125353] [2022-12-14 15:53:03,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:03,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:03,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:03,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:03,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748125353] [2022-12-14 15:53:03,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748125353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:03,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:03,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:53:03,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370442052] [2022-12-14 15:53:03,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:03,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:03,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:03,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:03,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:03,342 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:03,414 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2022-12-14 15:53:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:03,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 15:53:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:03,416 INFO L225 Difference]: With dead ends: 88 [2022-12-14 15:53:03,416 INFO L226 Difference]: Without dead ends: 87 [2022-12-14 15:53:03,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:03,417 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 46 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:03,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 69 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:53:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-12-14 15:53:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 68. [2022-12-14 15:53:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 67 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2022-12-14 15:53:03,425 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 5 [2022-12-14 15:53:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:03,426 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2022-12-14 15:53:03,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2022-12-14 15:53:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 15:53:03,426 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:03,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 15:53:03,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 15:53:03,427 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:03,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:03,428 INFO L85 PathProgramCache]: Analyzing trace with hash 185349669, now seen corresponding path program 1 times [2022-12-14 15:53:03,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:03,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794639594] [2022-12-14 15:53:03,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:03,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:03,480 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:03,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794639594] [2022-12-14 15:53:03,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794639594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:03,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:03,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:53:03,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063914077] [2022-12-14 15:53:03,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:03,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:03,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:03,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:03,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:03,482 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:03,527 INFO L93 Difference]: Finished difference Result 124 states and 187 transitions. [2022-12-14 15:53:03,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:03,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 15:53:03,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:03,529 INFO L225 Difference]: With dead ends: 124 [2022-12-14 15:53:03,529 INFO L226 Difference]: Without dead ends: 123 [2022-12-14 15:53:03,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:03,530 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 45 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:03,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-12-14 15:53:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-12-14 15:53:03,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 2.0470588235294116) internal successors, (174), 104 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 174 transitions. [2022-12-14 15:53:03,540 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 174 transitions. Word has length 5 [2022-12-14 15:53:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:03,540 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 174 transitions. [2022-12-14 15:53:03,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,541 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 174 transitions. [2022-12-14 15:53:03,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:53:03,541 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:03,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:53:03,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 15:53:03,541 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:03,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1450814034, now seen corresponding path program 1 times [2022-12-14 15:53:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:03,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182761267] [2022-12-14 15:53:03,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:03,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:03,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:03,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182761267] [2022-12-14 15:53:03,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182761267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:03,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:03,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:53:03,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828064948] [2022-12-14 15:53:03,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:03,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:03,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:03,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:03,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:03,616 INFO L87 Difference]: Start difference. First operand 105 states and 174 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:03,685 INFO L93 Difference]: Finished difference Result 160 states and 248 transitions. [2022-12-14 15:53:03,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:03,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 15:53:03,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:03,687 INFO L225 Difference]: With dead ends: 160 [2022-12-14 15:53:03,687 INFO L226 Difference]: Without dead ends: 160 [2022-12-14 15:53:03,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:03,688 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 50 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:03,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 95 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:53:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-12-14 15:53:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 139. [2022-12-14 15:53:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.9421487603305785) internal successors, (235), 138 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 235 transitions. [2022-12-14 15:53:03,699 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 235 transitions. Word has length 6 [2022-12-14 15:53:03,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:03,699 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 235 transitions. [2022-12-14 15:53:03,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,699 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 235 transitions. [2022-12-14 15:53:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:53:03,699 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:03,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:53:03,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 15:53:03,700 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:03,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1450814035, now seen corresponding path program 1 times [2022-12-14 15:53:03,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:03,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769774455] [2022-12-14 15:53:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:03,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:03,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769774455] [2022-12-14 15:53:03,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769774455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:03,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:03,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:53:03,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876696281] [2022-12-14 15:53:03,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:03,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:03,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:03,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:03,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:03,786 INFO L87 Difference]: Start difference. First operand 139 states and 235 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:03,843 INFO L93 Difference]: Finished difference Result 155 states and 239 transitions. [2022-12-14 15:53:03,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:03,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 15:53:03,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:03,845 INFO L225 Difference]: With dead ends: 155 [2022-12-14 15:53:03,845 INFO L226 Difference]: Without dead ends: 155 [2022-12-14 15:53:03,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:03,846 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 49 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:03,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 102 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:53:03,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-14 15:53:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2022-12-14 15:53:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 121 states have (on average 1.8760330578512396) internal successors, (227), 136 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 227 transitions. [2022-12-14 15:53:03,857 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 227 transitions. Word has length 6 [2022-12-14 15:53:03,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:03,857 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 227 transitions. [2022-12-14 15:53:03,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 227 transitions. [2022-12-14 15:53:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 15:53:03,858 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:03,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:03,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 15:53:03,858 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:03,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2025570098, now seen corresponding path program 1 times [2022-12-14 15:53:03,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:03,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164422199] [2022-12-14 15:53:03,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:03,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:03,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:03,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:03,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164422199] [2022-12-14 15:53:03,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164422199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:03,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:03,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:53:03,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140361369] [2022-12-14 15:53:03,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:03,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:53:03,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:03,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:53:03,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:53:03,915 INFO L87 Difference]: Start difference. First operand 137 states and 227 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:03,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:03,997 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2022-12-14 15:53:03,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:53:03,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 15:53:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:03,999 INFO L225 Difference]: With dead ends: 276 [2022-12-14 15:53:03,999 INFO L226 Difference]: Without dead ends: 276 [2022-12-14 15:53:03,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:53:04,000 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 114 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:04,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 296 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:53:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-12-14 15:53:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 167. [2022-12-14 15:53:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 151 states have (on average 1.8543046357615893) internal successors, (280), 166 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 280 transitions. [2022-12-14 15:53:04,010 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 280 transitions. Word has length 7 [2022-12-14 15:53:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:04,011 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 280 transitions. [2022-12-14 15:53:04,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 280 transitions. [2022-12-14 15:53:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 15:53:04,011 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:04,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:04,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 15:53:04,012 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1580480621, now seen corresponding path program 1 times [2022-12-14 15:53:04,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:04,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429824020] [2022-12-14 15:53:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:04,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:04,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429824020] [2022-12-14 15:53:04,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429824020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:04,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:04,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:04,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012648092] [2022-12-14 15:53:04,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:04,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:04,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:53:04,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:04,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:04,055 INFO L87 Difference]: Start difference. First operand 167 states and 280 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:04,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:04,106 INFO L93 Difference]: Finished difference Result 385 states and 587 transitions. [2022-12-14 15:53:04,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:53:04,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 15:53:04,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:04,108 INFO L225 Difference]: With dead ends: 385 [2022-12-14 15:53:04,108 INFO L226 Difference]: Without dead ends: 385 [2022-12-14 15:53:04,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:53:04,109 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 86 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:04,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 156 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-12-14 15:53:04,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 257. [2022-12-14 15:53:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 241 states have (on average 1.7468879668049793) internal successors, (421), 256 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 421 transitions. [2022-12-14 15:53:04,121 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 421 transitions. Word has length 8 [2022-12-14 15:53:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:04,121 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 421 transitions. [2022-12-14 15:53:04,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:04,122 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 421 transitions. [2022-12-14 15:53:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 15:53:04,122 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:04,122 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:04,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 15:53:04,123 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:04,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:04,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1408785848, now seen corresponding path program 1 times [2022-12-14 15:53:04,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:53:04,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455822512] [2022-12-14 15:53:04,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:04,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:53:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:04,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:53:04,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455822512] [2022-12-14 15:53:04,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455822512] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:53:04,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040083840] [2022-12-14 15:53:04,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:04,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:04,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:04,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:04,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 15:53:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:04,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 15:53:04,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:04,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:04,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040083840] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:04,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1022407434] [2022-12-14 15:53:04,388 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-12-14 15:53:04,388 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:53:04,392 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:53:04,396 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:53:04,396 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:53:04,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:04,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:04,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 15:53:04,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:04,579 INFO L350 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 26 treesize of output 28 [2022-12-14 15:53:04,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 15:53:04,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 15:53:04,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:53:04,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:53:04,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:04,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:04,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 15:53:04,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:04,818 INFO L350 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 26 treesize of output 28 [2022-12-14 15:53:04,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 15:53:04,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 15:53:04,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:04,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:53:04,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 15:53:04,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:53:04,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:53:05,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:53:05,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 15:53:05,255 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: NNF required for sound overapproximation. at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierOverapproximator.convert(QuantifierOverapproximator.java:59) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:158) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:86) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:319) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierOverapproximator.apply(QuantifierOverapproximator.java:85) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.Context.buildCriticalConstraintForConDis(Context.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.Context.buildCriticalConstraintForConDis(Context.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.Context.constructChildContextForConDis(Context.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.constructContextForApplicationTerm(QuantifierPushTermWalker.java:102) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.constructContextForApplicationTerm(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:167) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:53:05,258 INFO L158 Benchmark]: Toolchain (without parser) took 3068.32ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 87.1MB in the beginning and 42.1MB in the end (delta: 45.0MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2022-12-14 15:53:05,258 INFO L158 Benchmark]: CDTParser took 4.20ms. Allocated memory is still 123.7MB. Free memory was 94.3MB in the beginning and 101.1MB in the end (delta: -6.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:53:05,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.43ms. Allocated memory is still 123.7MB. Free memory was 86.6MB in the beginning and 69.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 15:53:05,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.59ms. Allocated memory is still 123.7MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:53:05,258 INFO L158 Benchmark]: Boogie Preprocessor took 19.69ms. Allocated memory is still 123.7MB. Free memory was 67.7MB in the beginning and 66.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:53:05,259 INFO L158 Benchmark]: RCFGBuilder took 431.31ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 66.1MB in the beginning and 120.1MB in the end (delta: -54.0MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2022-12-14 15:53:05,259 INFO L158 Benchmark]: TraceAbstraction took 2315.94ms. Allocated memory is still 148.9MB. Free memory was 119.2MB in the beginning and 42.1MB in the end (delta: 77.1MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. [2022-12-14 15:53:05,261 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.20ms. Allocated memory is still 123.7MB. Free memory was 94.3MB in the beginning and 101.1MB in the end (delta: -6.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.43ms. Allocated memory is still 123.7MB. Free memory was 86.6MB in the beginning and 69.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.59ms. Allocated memory is still 123.7MB. Free memory was 69.8MB in the beginning and 67.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.69ms. Allocated memory is still 123.7MB. Free memory was 67.7MB in the beginning and 66.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 431.31ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 66.1MB in the beginning and 120.1MB in the end (delta: -54.0MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2315.94ms. Allocated memory is still 148.9MB. Free memory was 119.2MB in the beginning and 42.1MB in the end (delta: 77.1MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: NNF required for sound overapproximation. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: NNF required for sound overapproximation.: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierOverapproximator.convert(QuantifierOverapproximator.java:59) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-14 15:53:05,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/lockfree-3.0.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce7b97696e85da66033a1f3711f1d24681434c76600ae3cd891d7ea07b7fcbea --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 15:53:07,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:53:07,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:53:07,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:53:07,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:53:07,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:53:07,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:53:07,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:53:07,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:53:07,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:53:07,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:53:07,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:53:07,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:53:07,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:53:07,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:53:07,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:53:07,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:53:07,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:53:07,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:53:07,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:53:07,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:53:07,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:53:07,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:53:07,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:53:07,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:53:07,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:53:07,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:53:07,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:53:07,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:53:07,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:53:07,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:53:07,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:53:07,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:53:07,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:53:07,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:53:07,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:53:07,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:53:07,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:53:07,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:53:07,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:53:07,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:53:07,121 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 15:53:07,148 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:53:07,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:53:07,148 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:53:07,148 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:53:07,149 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:53:07,149 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:53:07,149 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:53:07,150 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:53:07,150 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:53:07,150 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:53:07,150 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:53:07,150 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:53:07,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 15:53:07,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 15:53:07,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:53:07,151 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:53:07,152 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:53:07,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:53:07,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:53:07,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:53:07,152 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 15:53:07,152 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 15:53:07,152 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 15:53:07,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:53:07,152 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 15:53:07,153 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 15:53:07,153 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 15:53:07,153 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:53:07,153 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:53:07,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:53:07,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 15:53:07,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:53:07,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:53:07,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:53:07,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:53:07,154 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 15:53:07,154 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:07,154 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:53:07,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 15:53:07,154 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/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_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> ce7b97696e85da66033a1f3711f1d24681434c76600ae3cd891d7ea07b7fcbea [2022-12-14 15:53:07,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:53:07,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:53:07,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:53:07,380 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:53:07,381 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:53:07,382 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/memsafety/lockfree-3.0.i [2022-12-14 15:53:09,976 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:53:10,153 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:53:10,154 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/sv-benchmarks/c/memsafety/lockfree-3.0.i [2022-12-14 15:53:10,162 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/data/db8a79173/5f71da5a743a46978d1e62120e1d92fe/FLAG499e11da3 [2022-12-14 15:53:10,176 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/data/db8a79173/5f71da5a743a46978d1e62120e1d92fe [2022-12-14 15:53:10,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:53:10,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:53:10,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:53:10,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:53:10,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:53:10,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:53:10" (1/1) ... [2022-12-14 15:53:10,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11cb8679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:10, skipping insertion in model container [2022-12-14 15:53:10,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:53:10" (1/1) ... [2022-12-14 15:53:10,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:53:10,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:53:10,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:53:10,433 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:53:10,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:53:10,488 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:53:10,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:10 WrapperNode [2022-12-14 15:53:10,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:53:10,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:53:10,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:53:10,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:53:10,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:10" (1/1) ... [2022-12-14 15:53:10,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:10" (1/1) ... [2022-12-14 15:53:10,528 INFO L138 Inliner]: procedures = 128, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2022-12-14 15:53:10,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:53:10,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:53:10,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:53:10,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:53:10,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:10" (1/1) ... [2022-12-14 15:53:10,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:10" (1/1) ... [2022-12-14 15:53:10,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:10" (1/1) ... [2022-12-14 15:53:10,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:10" (1/1) ... [2022-12-14 15:53:10,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:10" (1/1) ... [2022-12-14 15:53:10,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:10" (1/1) ... [2022-12-14 15:53:10,554 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:10" (1/1) ... [2022-12-14 15:53:10,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:10" (1/1) ... [2022-12-14 15:53:10,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:53:10,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:53:10,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:53:10,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:53:10,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:10" (1/1) ... [2022-12-14 15:53:10,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:53:10,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:10,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:53:10,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:53:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 15:53:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 15:53:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:53:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 15:53:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 15:53:10,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:53:10,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 15:53:10,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 15:53:10,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:53:10,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:53:10,706 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:53:10,708 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:53:11,033 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:53:11,040 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:53:11,040 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 15:53:11,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:53:11 BoogieIcfgContainer [2022-12-14 15:53:11,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:53:11,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:53:11,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:53:11,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:53:11,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:53:10" (1/3) ... [2022-12-14 15:53:11,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f75a83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:53:11, skipping insertion in model container [2022-12-14 15:53:11,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:53:10" (2/3) ... [2022-12-14 15:53:11,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f75a83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:53:11, skipping insertion in model container [2022-12-14 15:53:11,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:53:11" (3/3) ... [2022-12-14 15:53:11,050 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.0.i [2022-12-14 15:53:11,068 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:53:11,068 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-12-14 15:53:11,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:53:11,116 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@15f5f5d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:53:11,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-12-14 15:53:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 15:53:11,125 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:11,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 15:53:11,126 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:11,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash 28701640, now seen corresponding path program 1 times [2022-12-14 15:53:11,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:11,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635587611] [2022-12-14 15:53:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:11,144 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 [2022-12-14 15:53:11,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:11,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:11,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 15:53:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:11,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:53:11,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:11,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:53:11,263 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:11,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635587611] [2022-12-14 15:53:11,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635587611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:11,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:11,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:53:11,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437139172] [2022-12-14 15:53:11,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:11,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:11,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:11,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:11,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:11,305 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.951219512195122) internal successors, (80), 61 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:11,369 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2022-12-14 15:53:11,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:11,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 15:53:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:11,381 INFO L225 Difference]: With dead ends: 107 [2022-12-14 15:53:11,381 INFO L226 Difference]: Without dead ends: 105 [2022-12-14 15:53:11,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:11,386 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 63 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 134 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 [2022-12-14 15:53:11,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 134 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-14 15:53:11,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2022-12-14 15:53:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 86 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2022-12-14 15:53:11,414 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 5 [2022-12-14 15:53:11,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:11,415 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2022-12-14 15:53:11,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2022-12-14 15:53:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:53:11,415 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:11,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:53:11,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:53:11,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:11,618 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:11,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:11,621 INFO L85 PathProgramCache]: Analyzing trace with hash 889749439, now seen corresponding path program 1 times [2022-12-14 15:53:11,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:11,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289856691] [2022-12-14 15:53:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:11,624 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 [2022-12-14 15:53:11,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:11,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:11,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 15:53:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:11,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 15:53:11,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:11,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:53:11,791 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:11,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289856691] [2022-12-14 15:53:11,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289856691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:11,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:11,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:53:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185732580] [2022-12-14 15:53:11,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:11,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:11,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:11,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:11,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:11,796 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:11,904 INFO L93 Difference]: Finished difference Result 163 states and 243 transitions. [2022-12-14 15:53:11,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:11,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 15:53:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:11,906 INFO L225 Difference]: With dead ends: 163 [2022-12-14 15:53:11,907 INFO L226 Difference]: Without dead ends: 160 [2022-12-14 15:53:11,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:11,908 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 62 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:11,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:53:11,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-12-14 15:53:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2022-12-14 15:53:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 139 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 229 transitions. [2022-12-14 15:53:11,921 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 229 transitions. Word has length 6 [2022-12-14 15:53:11,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:11,922 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 229 transitions. [2022-12-14 15:53:11,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 229 transitions. [2022-12-14 15:53:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:53:11,922 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:11,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:53:11,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 15:53:12,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:12,125 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:12,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:12,126 INFO L85 PathProgramCache]: Analyzing trace with hash 889692424, now seen corresponding path program 1 times [2022-12-14 15:53:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:12,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951801986] [2022-12-14 15:53:12,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:12,126 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 [2022-12-14 15:53:12,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:12,128 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:12,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 15:53:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:12,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:53:12,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:12,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2022-12-14 15:53:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:12,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:53:12,353 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:12,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951801986] [2022-12-14 15:53:12,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951801986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:12,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:12,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:53:12,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698437427] [2022-12-14 15:53:12,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:12,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:12,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:12,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:12,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:12,355 INFO L87 Difference]: Start difference. First operand 140 states and 229 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:12,494 INFO L93 Difference]: Finished difference Result 213 states and 331 transitions. [2022-12-14 15:53:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:12,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 15:53:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:12,496 INFO L225 Difference]: With dead ends: 213 [2022-12-14 15:53:12,497 INFO L226 Difference]: Without dead ends: 213 [2022-12-14 15:53:12,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:12,498 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 66 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:12,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 163 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:53:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-12-14 15:53:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 190. [2022-12-14 15:53:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 172 states have (on average 1.8372093023255813) internal successors, (316), 189 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 316 transitions. [2022-12-14 15:53:12,511 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 316 transitions. Word has length 6 [2022-12-14 15:53:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:12,511 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 316 transitions. [2022-12-14 15:53:12,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 316 transitions. [2022-12-14 15:53:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:53:12,512 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:12,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:53:12,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 15:53:12,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:12,714 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash 889692425, now seen corresponding path program 1 times [2022-12-14 15:53:12,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:12,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962112257] [2022-12-14 15:53:12,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:12,718 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 [2022-12-14 15:53:12,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:12,722 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:12,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 15:53:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:12,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:53:12,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:12,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:53:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:12,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:53:12,836 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:12,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962112257] [2022-12-14 15:53:12,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962112257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:12,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:12,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:53:12,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274797512] [2022-12-14 15:53:12,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:12,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:12,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:12,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:12,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:12,838 INFO L87 Difference]: Start difference. First operand 190 states and 316 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:12,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:12,966 INFO L93 Difference]: Finished difference Result 208 states and 322 transitions. [2022-12-14 15:53:12,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:12,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 15:53:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:12,968 INFO L225 Difference]: With dead ends: 208 [2022-12-14 15:53:12,968 INFO L226 Difference]: Without dead ends: 208 [2022-12-14 15:53:12,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:53:12,969 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 65 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:12,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 170 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:53:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-12-14 15:53:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 188. [2022-12-14 15:53:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 172 states have (on average 1.7906976744186047) internal successors, (308), 187 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 308 transitions. [2022-12-14 15:53:12,976 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 308 transitions. Word has length 6 [2022-12-14 15:53:12,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:12,976 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 308 transitions. [2022-12-14 15:53:12,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 308 transitions. [2022-12-14 15:53:12,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 15:53:12,976 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:12,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:12,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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)] Forceful destruction successful, exit code 0 [2022-12-14 15:53:13,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:13,178 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:13,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:13,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1810669365, now seen corresponding path program 1 times [2022-12-14 15:53:13,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:13,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764329252] [2022-12-14 15:53:13,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:13,182 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 [2022-12-14 15:53:13,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:13,185 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:13,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 15:53:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:13,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:53:13,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:13,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:53:13,277 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:13,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764329252] [2022-12-14 15:53:13,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764329252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:13,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:13,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:13,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887915881] [2022-12-14 15:53:13,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:13,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:13,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:13,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:13,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:13,279 INFO L87 Difference]: Start difference. First operand 188 states and 308 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:13,321 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2022-12-14 15:53:13,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:53:13,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 15:53:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:13,323 INFO L225 Difference]: With dead ends: 211 [2022-12-14 15:53:13,323 INFO L226 Difference]: Without dead ends: 211 [2022-12-14 15:53:13,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:53:13,325 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 101 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:13,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 229 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-12-14 15:53:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 144. [2022-12-14 15:53:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 132 states have (on average 1.7348484848484849) internal successors, (229), 143 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 229 transitions. [2022-12-14 15:53:13,334 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 229 transitions. Word has length 7 [2022-12-14 15:53:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:13,335 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 229 transitions. [2022-12-14 15:53:13,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 229 transitions. [2022-12-14 15:53:13,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 15:53:13,335 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:13,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:13,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 15:53:13,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:13,537 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:13,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:13,539 INFO L85 PathProgramCache]: Analyzing trace with hash 347531241, now seen corresponding path program 1 times [2022-12-14 15:53:13,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:13,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819735683] [2022-12-14 15:53:13,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:13,542 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 [2022-12-14 15:53:13,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:13,545 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:13,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 15:53:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:13,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:53:13,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:13,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:53:13,662 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:13,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819735683] [2022-12-14 15:53:13,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819735683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:13,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:53:13,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:53:13,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403389511] [2022-12-14 15:53:13,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:13,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:13,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:13,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:13,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:13,664 INFO L87 Difference]: Start difference. First operand 144 states and 229 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:13,701 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2022-12-14 15:53:13,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:53:13,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 15:53:13,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:13,702 INFO L225 Difference]: With dead ends: 283 [2022-12-14 15:53:13,702 INFO L226 Difference]: Without dead ends: 283 [2022-12-14 15:53:13,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:53:13,703 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:13,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 196 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-12-14 15:53:13,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 198. [2022-12-14 15:53:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 186 states have (on average 1.6559139784946237) internal successors, (308), 197 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 308 transitions. [2022-12-14 15:53:13,708 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 308 transitions. Word has length 8 [2022-12-14 15:53:13,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:13,708 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 308 transitions. [2022-12-14 15:53:13,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 308 transitions. [2022-12-14 15:53:13,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 15:53:13,708 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:13,708 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:13,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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)] Forceful destruction successful, exit code 0 [2022-12-14 15:53:13,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:13,910 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:13,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:13,912 INFO L85 PathProgramCache]: Analyzing trace with hash -527615340, now seen corresponding path program 1 times [2022-12-14 15:53:13,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:13,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804113839] [2022-12-14 15:53:13,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:13,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:13,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:13,916 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:13,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 15:53:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:14,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 15:53:14,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:14,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:14,058 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:14,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804113839] [2022-12-14 15:53:14,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804113839] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:14,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [523799117] [2022-12-14 15:53:14,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:14,059 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:14,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:14,060 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:14,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-12-14 15:53:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:14,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 15:53:14,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:14,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:14,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:14,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [523799117] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:14,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626960491] [2022-12-14 15:53:14,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:14,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:14,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:14,162 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:14,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 15:53:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:14,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 15:53:14,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:14,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:14,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626960491] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:14,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:53:14,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 9 [2022-12-14 15:53:14,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157987502] [2022-12-14 15:53:14,294 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:14,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 15:53:14,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:14,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 15:53:14,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:53:14,295 INFO L87 Difference]: Start difference. First operand 198 states and 308 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:14,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:14,507 INFO L93 Difference]: Finished difference Result 811 states and 1238 transitions. [2022-12-14 15:53:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:53:14,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 15:53:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:14,511 INFO L225 Difference]: With dead ends: 811 [2022-12-14 15:53:14,511 INFO L226 Difference]: Without dead ends: 811 [2022-12-14 15:53:14,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-12-14 15:53:14,512 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 546 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:14,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 833 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:53:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-12-14 15:53:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 438. [2022-12-14 15:53:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 426 states have (on average 1.619718309859155) internal successors, (690), 437 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 690 transitions. [2022-12-14 15:53:14,533 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 690 transitions. Word has length 12 [2022-12-14 15:53:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:14,533 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 690 transitions. [2022-12-14 15:53:14,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 690 transitions. [2022-12-14 15:53:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 15:53:14,534 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:14,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:14,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 15:53:14,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-14 15:53:14,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-12-14 15:53:15,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:15,138 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:15,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:15,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2027186576, now seen corresponding path program 1 times [2022-12-14 15:53:15,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:15,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387453155] [2022-12-14 15:53:15,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:15,141 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 [2022-12-14 15:53:15,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:15,143 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:15,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-14 15:53:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:15,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:53:15,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:15,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:15,241 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:15,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387453155] [2022-12-14 15:53:15,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387453155] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:15,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2010581733] [2022-12-14 15:53:15,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:15,242 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:15,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:15,243 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:15,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-12-14 15:53:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:15,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:53:15,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:15,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:15,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2010581733] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:15,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217531198] [2022-12-14 15:53:15,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:15,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:15,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:15,338 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:15,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 15:53:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:15,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:53:15,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:15,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:15,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:15,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217531198] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:15,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:53:15,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 3, 3] total 5 [2022-12-14 15:53:15,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656248607] [2022-12-14 15:53:15,411 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:15,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:53:15,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:15,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:53:15,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:53:15,412 INFO L87 Difference]: Start difference. First operand 438 states and 690 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:15,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:15,455 INFO L93 Difference]: Finished difference Result 1016 states and 1552 transitions. [2022-12-14 15:53:15,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:53:15,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 15:53:15,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:15,457 INFO L225 Difference]: With dead ends: 1016 [2022-12-14 15:53:15,457 INFO L226 Difference]: Without dead ends: 1016 [2022-12-14 15:53:15,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:53:15,458 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 240 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:15,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 298 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2022-12-14 15:53:15,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 992. [2022-12-14 15:53:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 980 states have (on average 1.583673469387755) internal successors, (1552), 991 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:15,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1552 transitions. [2022-12-14 15:53:15,472 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1552 transitions. Word has length 12 [2022-12-14 15:53:15,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:15,472 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1552 transitions. [2022-12-14 15:53:15,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:15,472 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1552 transitions. [2022-12-14 15:53:15,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 15:53:15,472 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:15,473 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:15,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2022-12-14 15:53:15,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-14 15:53:15,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-14 15:53:16,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:16,074 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:16,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:16,074 INFO L85 PathProgramCache]: Analyzing trace with hash -480845608, now seen corresponding path program 1 times [2022-12-14 15:53:16,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:16,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437599181] [2022-12-14 15:53:16,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:16,076 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 [2022-12-14 15:53:16,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:16,077 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:16,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 15:53:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:16,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:53:16,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:16,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:16,199 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:16,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437599181] [2022-12-14 15:53:16,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437599181] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:16,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [455003918] [2022-12-14 15:53:16,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:16,199 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:16,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:16,200 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:16,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-12-14 15:53:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:16,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:53:16,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:16,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:16,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [455003918] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:16,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099374155] [2022-12-14 15:53:16,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:16,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:16,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:16,349 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:16,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 15:53:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:16,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:53:16,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:16,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:16,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099374155] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:16,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:53:16,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 3, 3] total 3 [2022-12-14 15:53:16,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125188263] [2022-12-14 15:53:16,481 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:16,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:16,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:16,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:16,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:16,482 INFO L87 Difference]: Start difference. First operand 992 states and 1552 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:16,563 INFO L93 Difference]: Finished difference Result 1263 states and 1901 transitions. [2022-12-14 15:53:16,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:53:16,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 15:53:16,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:16,566 INFO L225 Difference]: With dead ends: 1263 [2022-12-14 15:53:16,566 INFO L226 Difference]: Without dead ends: 1263 [2022-12-14 15:53:16,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:53:16,567 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 104 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:16,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 167 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:53:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2022-12-14 15:53:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1120. [2022-12-14 15:53:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1108 states have (on average 1.536101083032491) internal successors, (1702), 1119 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1702 transitions. [2022-12-14 15:53:16,584 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1702 transitions. Word has length 18 [2022-12-14 15:53:16,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:16,585 INFO L495 AbstractCegarLoop]: Abstraction has 1120 states and 1702 transitions. [2022-12-14 15:53:16,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:16,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1702 transitions. [2022-12-14 15:53:16,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 15:53:16,585 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:16,585 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:16,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 15:53:16,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 15:53:16,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2022-12-14 15:53:17,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:17,188 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:17,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1323238580, now seen corresponding path program 1 times [2022-12-14 15:53:17,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:17,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027556904] [2022-12-14 15:53:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:17,189 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 [2022-12-14 15:53:17,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:17,191 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:17,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-12-14 15:53:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:17,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 15:53:17,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:17,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:17,301 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:17,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027556904] [2022-12-14 15:53:17,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027556904] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:17,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1894881452] [2022-12-14 15:53:17,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:17,302 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:17,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:17,302 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:17,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-12-14 15:53:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:17,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 15:53:17,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:17,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:17,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:17,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1894881452] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:17,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591139041] [2022-12-14 15:53:17,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:17,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:17,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:17,456 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:17,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 15:53:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:17,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 15:53:17,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:17,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:17,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:17,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591139041] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:17,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:53:17,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 9 [2022-12-14 15:53:17,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110939462] [2022-12-14 15:53:17,585 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:17,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 15:53:17,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:17,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 15:53:17,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:53:17,587 INFO L87 Difference]: Start difference. First operand 1120 states and 1702 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:17,830 INFO L93 Difference]: Finished difference Result 1823 states and 2638 transitions. [2022-12-14 15:53:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 15:53:17,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 15:53:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:17,834 INFO L225 Difference]: With dead ends: 1823 [2022-12-14 15:53:17,834 INFO L226 Difference]: Without dead ends: 1823 [2022-12-14 15:53:17,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:53:17,834 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 646 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:17,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 984 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:53:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2022-12-14 15:53:17,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1081. [2022-12-14 15:53:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1069 states have (on average 1.519176800748363) internal successors, (1624), 1080 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1624 transitions. [2022-12-14 15:53:17,852 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1624 transitions. Word has length 21 [2022-12-14 15:53:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:17,852 INFO L495 AbstractCegarLoop]: Abstraction has 1081 states and 1624 transitions. [2022-12-14 15:53:17,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1624 transitions. [2022-12-14 15:53:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 15:53:17,852 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:17,853 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:17,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2022-12-14 15:53:18,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-14 15:53:18,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-12-14 15:53:18,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:18,455 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:18,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2049591299, now seen corresponding path program 1 times [2022-12-14 15:53:18,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:18,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856357647] [2022-12-14 15:53:18,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:18,458 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 [2022-12-14 15:53:18,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:18,460 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:18,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 15:53:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:18,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:53:18,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 15:53:18,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 15:53:18,661 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:18,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856357647] [2022-12-14 15:53:18,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856357647] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:18,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1078308697] [2022-12-14 15:53:18,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:18,661 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:18,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:18,663 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:18,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-12-14 15:53:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:18,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:53:18,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 15:53:18,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 15:53:18,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1078308697] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:18,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151435521] [2022-12-14 15:53:18,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:18,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:18,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:18,822 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:18,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 15:53:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:18,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:53:18,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 15:53:18,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:53:18,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151435521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:18,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2022-12-14 15:53:18,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5, 5, 5] total 10 [2022-12-14 15:53:18,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529948736] [2022-12-14 15:53:18,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:18,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:18,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:18,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:18,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:53:18,932 INFO L87 Difference]: Start difference. First operand 1081 states and 1624 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:18,980 INFO L93 Difference]: Finished difference Result 1319 states and 1974 transitions. [2022-12-14 15:53:18,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:18,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 15:53:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:18,985 INFO L225 Difference]: With dead ends: 1319 [2022-12-14 15:53:18,985 INFO L226 Difference]: Without dead ends: 1319 [2022-12-14 15:53:18,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:53:18,986 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 64 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 201 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 [2022-12-14 15:53:18,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 201 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:18,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-12-14 15:53:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1197. [2022-12-14 15:53:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1185 states have (on average 1.5181434599156118) internal successors, (1799), 1196 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1799 transitions. [2022-12-14 15:53:19,010 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1799 transitions. Word has length 30 [2022-12-14 15:53:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:19,011 INFO L495 AbstractCegarLoop]: Abstraction has 1197 states and 1799 transitions. [2022-12-14 15:53:19,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1799 transitions. [2022-12-14 15:53:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 15:53:19,012 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:19,012 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:19,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-14 15:53:19,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-12-14 15:53:19,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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 [2022-12-14 15:53:19,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:19,613 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:19,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:19,614 INFO L85 PathProgramCache]: Analyzing trace with hash -134919915, now seen corresponding path program 1 times [2022-12-14 15:53:19,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:19,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711525641] [2022-12-14 15:53:19,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:19,617 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 [2022-12-14 15:53:19,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:19,620 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:19,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-12-14 15:53:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:19,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:53:19,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 15:53:19,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 15:53:19,756 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:19,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711525641] [2022-12-14 15:53:19,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711525641] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:19,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [328831999] [2022-12-14 15:53:19,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:19,757 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:19,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:19,758 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:19,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-12-14 15:53:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:19,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:53:19,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 15:53:19,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 15:53:19,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [328831999] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:19,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246693644] [2022-12-14 15:53:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:19,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:19,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:19,917 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:19,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 15:53:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:19,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 15:53:19,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:20,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:20,091 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:20,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246693644] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:20,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:53:20,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 7, 7] total 13 [2022-12-14 15:53:20,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839137399] [2022-12-14 15:53:20,092 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:20,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:53:20,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:20,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:53:20,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:53:20,094 INFO L87 Difference]: Start difference. First operand 1197 states and 1799 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:20,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:20,553 INFO L93 Difference]: Finished difference Result 3756 states and 5481 transitions. [2022-12-14 15:53:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 15:53:20,554 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 15:53:20,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:20,560 INFO L225 Difference]: With dead ends: 3756 [2022-12-14 15:53:20,560 INFO L226 Difference]: Without dead ends: 3756 [2022-12-14 15:53:20,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 15:53:20,561 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 2366 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2366 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:20,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2366 Valid, 1193 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:53:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3756 states. [2022-12-14 15:53:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3756 to 2478. [2022-12-14 15:53:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2466 states have (on average 1.494728304947283) internal successors, (3686), 2477 states have internal predecessors, (3686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3686 transitions. [2022-12-14 15:53:20,598 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 3686 transitions. Word has length 30 [2022-12-14 15:53:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:20,598 INFO L495 AbstractCegarLoop]: Abstraction has 2478 states and 3686 transitions. [2022-12-14 15:53:20,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 3686 transitions. [2022-12-14 15:53:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 15:53:20,599 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:20,599 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:20,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2022-12-14 15:53:20,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-12-14 15:53:21,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-14 15:53:21,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:21,201 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:21,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:21,202 INFO L85 PathProgramCache]: Analyzing trace with hash 971894434, now seen corresponding path program 1 times [2022-12-14 15:53:21,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:21,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549955955] [2022-12-14 15:53:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:21,204 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 [2022-12-14 15:53:21,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:21,206 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:21,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-12-14 15:53:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:21,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:53:21,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 15:53:21,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 15:53:21,342 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:21,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549955955] [2022-12-14 15:53:21,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549955955] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:21,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1589194733] [2022-12-14 15:53:21,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:21,342 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:21,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:21,343 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:21,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-12-14 15:53:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:21,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:53:21,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 15:53:21,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 15:53:21,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1589194733] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:21,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591446648] [2022-12-14 15:53:21,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:21,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:21,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:21,482 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:21,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-14 15:53:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:21,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:53:21,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:21,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2022-12-14 15:53:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 15:53:21,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 15:53:21,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591446648] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:21,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:53:21,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 4, 4] total 10 [2022-12-14 15:53:21,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705177179] [2022-12-14 15:53:21,672 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:21,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 15:53:21,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:21,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 15:53:21,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:53:21,673 INFO L87 Difference]: Start difference. First operand 2478 states and 3686 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:23,458 INFO L93 Difference]: Finished difference Result 9543 states and 14328 transitions. [2022-12-14 15:53:23,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-14 15:53:23,459 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-12-14 15:53:23,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:23,510 INFO L225 Difference]: With dead ends: 9543 [2022-12-14 15:53:23,510 INFO L226 Difference]: Without dead ends: 9543 [2022-12-14 15:53:23,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=367, Invalid=1795, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 15:53:23,512 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 1003 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:23,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 1180 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 15:53:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9543 states. [2022-12-14 15:53:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9543 to 6617. [2022-12-14 15:53:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6617 states, 6606 states have (on average 1.5158946412352408) internal successors, (10014), 6616 states have internal predecessors, (10014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 10014 transitions. [2022-12-14 15:53:23,644 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 10014 transitions. Word has length 39 [2022-12-14 15:53:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:23,644 INFO L495 AbstractCegarLoop]: Abstraction has 6617 states and 10014 transitions. [2022-12-14 15:53:23,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 10014 transitions. [2022-12-14 15:53:23,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 15:53:23,645 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:23,645 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:23,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2022-12-14 15:53:23,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-14 15:53:24,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-12-14 15:53:24,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:24,248 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:24,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1822753242, now seen corresponding path program 1 times [2022-12-14 15:53:24,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:24,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078171048] [2022-12-14 15:53:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:24,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:24,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:24,252 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:24,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-12-14 15:53:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:24,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 15:53:24,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:24,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:24,436 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:24,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078171048] [2022-12-14 15:53:24,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078171048] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:24,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [535390259] [2022-12-14 15:53:24,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:24,436 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:24,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:24,437 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:24,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-12-14 15:53:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:24,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 15:53:24,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:24,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:24,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [535390259] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:24,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316641010] [2022-12-14 15:53:24,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:24,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:24,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:24,616 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:24,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-14 15:53:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:24,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 15:53:24,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:24,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:53:24,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316641010] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:24,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:53:24,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 15 [2022-12-14 15:53:24,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529121021] [2022-12-14 15:53:24,843 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:24,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:53:24,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:24,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:53:24,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:53:24,844 INFO L87 Difference]: Start difference. First operand 6617 states and 10014 transitions. Second operand has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:25,448 INFO L93 Difference]: Finished difference Result 10931 states and 16562 transitions. [2022-12-14 15:53:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-14 15:53:25,449 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-12-14 15:53:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:25,466 INFO L225 Difference]: With dead ends: 10931 [2022-12-14 15:53:25,467 INFO L226 Difference]: Without dead ends: 10931 [2022-12-14 15:53:25,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=430, Invalid=1826, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 15:53:25,473 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 1958 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1958 SdHoareTripleChecker+Valid, 2247 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:25,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1958 Valid, 2247 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:53:25,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10931 states. [2022-12-14 15:53:25,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10931 to 7404. [2022-12-14 15:53:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7404 states, 7393 states have (on average 1.5112944677397537) internal successors, (11173), 7403 states have internal predecessors, (11173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7404 states to 7404 states and 11173 transitions. [2022-12-14 15:53:25,612 INFO L78 Accepts]: Start accepts. Automaton has 7404 states and 11173 transitions. Word has length 41 [2022-12-14 15:53:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:25,612 INFO L495 AbstractCegarLoop]: Abstraction has 7404 states and 11173 transitions. [2022-12-14 15:53:25,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 7404 states and 11173 transitions. [2022-12-14 15:53:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 15:53:25,613 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:25,613 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:25,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2022-12-14 15:53:25,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-14 15:53:26,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-12-14 15:53:26,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:26,215 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:26,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:26,216 INFO L85 PathProgramCache]: Analyzing trace with hash 34201258, now seen corresponding path program 1 times [2022-12-14 15:53:26,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:26,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704454175] [2022-12-14 15:53:26,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:26,218 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 [2022-12-14 15:53:26,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:26,219 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:26,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-12-14 15:53:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:26,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:53:26,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 15:53:26,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 15:53:26,416 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:26,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704454175] [2022-12-14 15:53:26,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704454175] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:26,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1222763612] [2022-12-14 15:53:26,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:26,416 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:26,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:26,417 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:26,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2022-12-14 15:53:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:26,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:53:26,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 15:53:26,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 15:53:26,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1222763612] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:26,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388462295] [2022-12-14 15:53:26,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:26,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:26,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:26,634 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:26,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-14 15:53:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:26,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:53:26,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 15:53:26,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 15:53:26,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388462295] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:26,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:53:26,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 4 [2022-12-14 15:53:26,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125537911] [2022-12-14 15:53:26,799 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:26,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:53:26,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:26,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:53:26,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:53:26,800 INFO L87 Difference]: Start difference. First operand 7404 states and 11173 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:26,897 INFO L93 Difference]: Finished difference Result 7409 states and 11103 transitions. [2022-12-14 15:53:26,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:53:26,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-12-14 15:53:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:26,906 INFO L225 Difference]: With dead ends: 7409 [2022-12-14 15:53:26,907 INFO L226 Difference]: Without dead ends: 7409 [2022-12-14 15:53:26,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:53:26,907 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 109 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:26,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 158 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:53:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7409 states. [2022-12-14 15:53:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7409 to 7404. [2022-12-14 15:53:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7404 states, 7393 states have (on average 1.501826051670499) internal successors, (11103), 7403 states have internal predecessors, (11103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7404 states to 7404 states and 11103 transitions. [2022-12-14 15:53:26,983 INFO L78 Accepts]: Start accepts. Automaton has 7404 states and 11103 transitions. Word has length 50 [2022-12-14 15:53:26,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:26,983 INFO L495 AbstractCegarLoop]: Abstraction has 7404 states and 11103 transitions. [2022-12-14 15:53:26,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 7404 states and 11103 transitions. [2022-12-14 15:53:26,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 15:53:26,984 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:26,984 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:26,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-12-14 15:53:27,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2022-12-14 15:53:27,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-12-14 15:53:27,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:27,586 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:27,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:27,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1339034764, now seen corresponding path program 1 times [2022-12-14 15:53:27,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:27,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744343309] [2022-12-14 15:53:27,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:27,589 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 [2022-12-14 15:53:27,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:27,591 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:27,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-12-14 15:53:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:27,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:53:27,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:27,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:53:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 15:53:27,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 15:53:28,215 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:28,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744343309] [2022-12-14 15:53:28,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744343309] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:28,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [367219496] [2022-12-14 15:53:28,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:28,215 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:28,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:28,216 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:28,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-12-14 15:53:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:28,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:53:28,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:28,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:53:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 15:53:28,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 15:53:28,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [367219496] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:28,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083614916] [2022-12-14 15:53:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:28,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:28,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:28,790 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:28,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-14 15:53:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:28,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:53:28,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:28,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:53:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 15:53:28,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 15:53:29,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083614916] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:29,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:53:29,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 7 [2022-12-14 15:53:29,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197951871] [2022-12-14 15:53:29,251 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:29,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:53:29,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:29,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:53:29,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:53:29,252 INFO L87 Difference]: Start difference. First operand 7404 states and 11103 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:29,969 INFO L93 Difference]: Finished difference Result 12129 states and 17905 transitions. [2022-12-14 15:53:29,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:53:29,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-12-14 15:53:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:29,982 INFO L225 Difference]: With dead ends: 12129 [2022-12-14 15:53:29,982 INFO L226 Difference]: Without dead ends: 12129 [2022-12-14 15:53:29,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:53:29,983 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 450 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:29,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 320 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:53:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12129 states. [2022-12-14 15:53:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12129 to 10720. [2022-12-14 15:53:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10720 states, 10709 states have (on average 1.495471099075544) internal successors, (16015), 10719 states have internal predecessors, (16015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10720 states to 10720 states and 16015 transitions. [2022-12-14 15:53:30,077 INFO L78 Accepts]: Start accepts. Automaton has 10720 states and 16015 transitions. Word has length 53 [2022-12-14 15:53:30,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:30,078 INFO L495 AbstractCegarLoop]: Abstraction has 10720 states and 16015 transitions. [2022-12-14 15:53:30,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 10720 states and 16015 transitions. [2022-12-14 15:53:30,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-14 15:53:30,079 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:30,079 INFO L195 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:30,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2022-12-14 15:53:30,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2022-12-14 15:53:30,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-12-14 15:53:30,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:30,681 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:30,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:30,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1485538747, now seen corresponding path program 1 times [2022-12-14 15:53:30,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:30,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790920178] [2022-12-14 15:53:30,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:30,684 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 [2022-12-14 15:53:30,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:30,686 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:30,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-12-14 15:53:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:30,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:53:30,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 45 proven. 31 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 15:53:31,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 45 proven. 31 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 15:53:31,108 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:31,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790920178] [2022-12-14 15:53:31,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790920178] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:31,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1409563800] [2022-12-14 15:53:31,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:31,108 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:31,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:31,109 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:31,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-12-14 15:53:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:31,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 15:53:31,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 45 proven. 57 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 15:53:31,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 45 proven. 31 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 15:53:31,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1409563800] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:31,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605610032] [2022-12-14 15:53:31,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:31,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:31,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:31,384 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:31,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-14 15:53:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:31,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 15:53:31,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 28 proven. 52 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 15:53:31,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 28 proven. 52 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 15:53:31,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605610032] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:31,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:53:31,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8, 6, 6, 6] total 14 [2022-12-14 15:53:31,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501254149] [2022-12-14 15:53:31,669 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:31,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 15:53:31,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:31,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 15:53:31,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:53:31,671 INFO L87 Difference]: Start difference. First operand 10720 states and 16015 transitions. Second operand has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:32,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:32,085 INFO L93 Difference]: Finished difference Result 29828 states and 42606 transitions. [2022-12-14 15:53:32,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 15:53:32,086 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-12-14 15:53:32,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:32,120 INFO L225 Difference]: With dead ends: 29828 [2022-12-14 15:53:32,120 INFO L226 Difference]: Without dead ends: 29828 [2022-12-14 15:53:32,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 15:53:32,121 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 1107 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:32,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 1217 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:53:32,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29828 states. [2022-12-14 15:53:32,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29828 to 20704. [2022-12-14 15:53:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20704 states, 20693 states have (on average 1.4639249987918619) internal successors, (30293), 20703 states have internal predecessors, (30293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20704 states to 20704 states and 30293 transitions. [2022-12-14 15:53:32,338 INFO L78 Accepts]: Start accepts. Automaton has 20704 states and 30293 transitions. Word has length 65 [2022-12-14 15:53:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:32,338 INFO L495 AbstractCegarLoop]: Abstraction has 20704 states and 30293 transitions. [2022-12-14 15:53:32,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 20704 states and 30293 transitions. [2022-12-14 15:53:32,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-14 15:53:32,340 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:32,340 INFO L195 NwaCegarLoop]: trace histogram [11, 6, 6, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:32,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-14 15:53:32,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2022-12-14 15:53:32,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2022-12-14 15:53:32,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:32,942 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:32,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:32,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1309989099, now seen corresponding path program 1 times [2022-12-14 15:53:32,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:32,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160860604] [2022-12-14 15:53:32,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:32,945 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 [2022-12-14 15:53:32,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:32,948 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:32,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-12-14 15:53:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:33,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 15:53:33,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 55 proven. 83 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-14 15:53:33,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 55 proven. 83 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-14 15:53:33,465 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:33,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160860604] [2022-12-14 15:53:33,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160860604] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:33,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1312580688] [2022-12-14 15:53:33,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:33,466 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:33,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:33,467 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:33,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-12-14 15:53:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:33,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:53:33,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-14 15:53:33,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:53:33,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1312580688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:53:33,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:53:33,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 8] total 16 [2022-12-14 15:53:33,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459345337] [2022-12-14 15:53:33,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:33,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:53:33,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:33,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:53:33,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:53:33,731 INFO L87 Difference]: Start difference. First operand 20704 states and 30293 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:33,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:33,835 INFO L93 Difference]: Finished difference Result 25688 states and 37138 transitions. [2022-12-14 15:53:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:53:33,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-12-14 15:53:33,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:33,869 INFO L225 Difference]: With dead ends: 25688 [2022-12-14 15:53:33,869 INFO L226 Difference]: Without dead ends: 25688 [2022-12-14 15:53:33,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:53:33,870 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 50 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:33,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 137 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:53:33,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25688 states. [2022-12-14 15:53:34,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25688 to 24798. [2022-12-14 15:53:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24798 states, 24787 states have (on average 1.4489450114979627) internal successors, (35915), 24797 states have internal predecessors, (35915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24798 states to 24798 states and 35915 transitions. [2022-12-14 15:53:34,105 INFO L78 Accepts]: Start accepts. Automaton has 24798 states and 35915 transitions. Word has length 82 [2022-12-14 15:53:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:34,105 INFO L495 AbstractCegarLoop]: Abstraction has 24798 states and 35915 transitions. [2022-12-14 15:53:34,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 24798 states and 35915 transitions. [2022-12-14 15:53:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 15:53:34,107 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:34,108 INFO L195 NwaCegarLoop]: trace histogram [11, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:34,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2022-12-14 15:53:34,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Ended with exit code 0 [2022-12-14 15:53:34,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:34,509 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:34,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:34,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1674253856, now seen corresponding path program 1 times [2022-12-14 15:53:34,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:34,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452478770] [2022-12-14 15:53:34,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:34,512 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 [2022-12-14 15:53:34,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:34,515 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:34,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-12-14 15:53:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:34,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 15:53:34,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 55 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-14 15:53:34,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 55 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-14 15:53:35,347 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:35,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452478770] [2022-12-14 15:53:35,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452478770] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:35,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [277669516] [2022-12-14 15:53:35,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:35,348 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:35,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:35,349 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:35,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2022-12-14 15:53:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:35,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 15:53:35,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 55 proven. 96 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-12-14 15:53:35,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 55 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-14 15:53:35,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [277669516] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:35,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596217022] [2022-12-14 15:53:35,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:35,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:35,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:35,706 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:35,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-14 15:53:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:35,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:53:35,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 88 proven. 4 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-12-14 15:53:35,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-12-14 15:53:35,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596217022] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 15:53:35,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 5 imperfect interpolant sequences. [2022-12-14 15:53:35,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 10, 9, 8, 7] total 29 [2022-12-14 15:53:35,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478838004] [2022-12-14 15:53:35,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:53:35,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:53:35,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:35,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:53:35,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2022-12-14 15:53:35,951 INFO L87 Difference]: Start difference. First operand 24798 states and 35915 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:36,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:36,190 INFO L93 Difference]: Finished difference Result 61006 states and 86130 transitions. [2022-12-14 15:53:36,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:53:36,190 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-12-14 15:53:36,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:36,246 INFO L225 Difference]: With dead ends: 61006 [2022-12-14 15:53:36,246 INFO L226 Difference]: Without dead ends: 61006 [2022-12-14 15:53:36,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 15:53:36,247 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 202 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:36,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 342 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:53:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61006 states. [2022-12-14 15:53:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61006 to 37820. [2022-12-14 15:53:36,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37820 states, 37809 states have (on average 1.4424343410299134) internal successors, (54537), 37819 states have internal predecessors, (54537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37820 states to 37820 states and 54537 transitions. [2022-12-14 15:53:36,729 INFO L78 Accepts]: Start accepts. Automaton has 37820 states and 54537 transitions. Word has length 84 [2022-12-14 15:53:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:36,730 INFO L495 AbstractCegarLoop]: Abstraction has 37820 states and 54537 transitions. [2022-12-14 15:53:36,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 37820 states and 54537 transitions. [2022-12-14 15:53:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-14 15:53:36,734 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:36,734 INFO L195 NwaCegarLoop]: trace histogram [11, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:36,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Ended with exit code 0 [2022-12-14 15:53:36,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-12-14 15:53:37,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (44)] Ended with exit code 0 [2022-12-14 15:53:37,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:37,336 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:37,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:37,337 INFO L85 PathProgramCache]: Analyzing trace with hash -160581693, now seen corresponding path program 1 times [2022-12-14 15:53:37,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:37,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36726688] [2022-12-14 15:53:37,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:37,338 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 [2022-12-14 15:53:37,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:37,339 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:37,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-12-14 15:53:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:37,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 15:53:37,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:37,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2022-12-14 15:53:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:37,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:37,720 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:37,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36726688] [2022-12-14 15:53:37,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36726688] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:37,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1707612554] [2022-12-14 15:53:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:37,720 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:37,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:37,721 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:37,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (47)] Waiting until timeout for monitored process [2022-12-14 15:53:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:37,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 15:53:37,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:37,939 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 15:53:37,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 20 [2022-12-14 15:53:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 115 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 15:53:38,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 115 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 15:53:38,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1707612554] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:38,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842272199] [2022-12-14 15:53:38,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:38,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:38,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:38,311 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:38,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-14 15:53:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:38,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 15:53:38,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:38,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2022-12-14 15:53:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:38,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:38,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842272199] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:38,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:53:38,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 10 [2022-12-14 15:53:38,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322301502] [2022-12-14 15:53:38,626 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:38,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 15:53:38,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:38,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 15:53:38,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:53:38,628 INFO L87 Difference]: Start difference. First operand 37820 states and 54537 transitions. Second operand has 11 states, 10 states have (on average 13.0) internal successors, (130), 11 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:39,638 INFO L93 Difference]: Finished difference Result 38799 states and 55885 transitions. [2022-12-14 15:53:39,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:53:39,639 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.0) internal successors, (130), 11 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-12-14 15:53:39,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:39,671 INFO L225 Difference]: With dead ends: 38799 [2022-12-14 15:53:39,671 INFO L226 Difference]: Without dead ends: 38799 [2022-12-14 15:53:39,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:53:39,671 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 356 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:39,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 711 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:53:39,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38799 states. [2022-12-14 15:53:39,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38799 to 37821. [2022-12-14 15:53:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37821 states, 37811 states have (on average 1.4424373859458888) internal successors, (54540), 37820 states have internal predecessors, (54540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37821 states to 37821 states and 54540 transitions. [2022-12-14 15:53:40,077 INFO L78 Accepts]: Start accepts. Automaton has 37821 states and 54540 transitions. Word has length 87 [2022-12-14 15:53:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:40,077 INFO L495 AbstractCegarLoop]: Abstraction has 37821 states and 54540 transitions. [2022-12-14 15:53:40,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.0) internal successors, (130), 11 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 37821 states and 54540 transitions. [2022-12-14 15:53:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-14 15:53:40,081 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:40,081 INFO L195 NwaCegarLoop]: trace histogram [11, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:40,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Ended with exit code 0 [2022-12-14 15:53:40,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (47)] Ended with exit code 0 [2022-12-14 15:53:40,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-12-14 15:53:40,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:40,683 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:40,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:40,685 INFO L85 PathProgramCache]: Analyzing trace with hash -160581692, now seen corresponding path program 1 times [2022-12-14 15:53:40,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:40,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603627236] [2022-12-14 15:53:40,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:40,688 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 [2022-12-14 15:53:40,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:40,691 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:40,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2022-12-14 15:53:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:40,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 15:53:40,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:40,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:53:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:41,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:41,777 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:41,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603627236] [2022-12-14 15:53:41,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603627236] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:41,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [879010354] [2022-12-14 15:53:41,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:41,777 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:41,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:41,778 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:41,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (50)] Waiting until timeout for monitored process [2022-12-14 15:53:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:41,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 15:53:41,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:41,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:53:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 115 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 15:53:42,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 115 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 15:53:42,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [879010354] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:42,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965318338] [2022-12-14 15:53:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:42,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:42,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:42,617 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:42,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-14 15:53:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:42,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 15:53:42,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:42,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 15:53:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:42,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:43,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965318338] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:43,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:53:43,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 9 [2022-12-14 15:53:43,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586216521] [2022-12-14 15:53:43,470 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:43,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 15:53:43,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:43,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 15:53:43,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:53:43,471 INFO L87 Difference]: Start difference. First operand 37821 states and 54540 transitions. Second operand has 10 states, 9 states have (on average 14.88888888888889) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:45,719 INFO L93 Difference]: Finished difference Result 73108 states and 105516 transitions. [2022-12-14 15:53:45,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 15:53:45,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.88888888888889) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-12-14 15:53:45,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:45,785 INFO L225 Difference]: With dead ends: 73108 [2022-12-14 15:53:45,785 INFO L226 Difference]: Without dead ends: 73108 [2022-12-14 15:53:45,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=486, Unknown=0, NotChecked=0, Total=702 [2022-12-14 15:53:45,786 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 721 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:45,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 764 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 15:53:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73108 states. [2022-12-14 15:53:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73108 to 69317. [2022-12-14 15:53:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69317 states, 69307 states have (on average 1.4447891266394448) internal successors, (100134), 69316 states have internal predecessors, (100134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69317 states to 69317 states and 100134 transitions. [2022-12-14 15:53:46,629 INFO L78 Accepts]: Start accepts. Automaton has 69317 states and 100134 transitions. Word has length 87 [2022-12-14 15:53:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:46,629 INFO L495 AbstractCegarLoop]: Abstraction has 69317 states and 100134 transitions. [2022-12-14 15:53:46,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.88888888888889) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 69317 states and 100134 transitions. [2022-12-14 15:53:46,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-14 15:53:46,633 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:46,633 INFO L195 NwaCegarLoop]: trace histogram [11, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:46,645 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Ended with exit code 0 [2022-12-14 15:53:46,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-12-14 15:53:47,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (50)] Ended with exit code 0 [2022-12-14 15:53:47,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:47,247 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:47,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:47,249 INFO L85 PathProgramCache]: Analyzing trace with hash -683066588, now seen corresponding path program 1 times [2022-12-14 15:53:47,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:47,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733734126] [2022-12-14 15:53:47,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:47,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:47,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:47,252 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:47,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2022-12-14 15:53:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:47,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:53:47,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:47,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:47,542 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:47,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733734126] [2022-12-14 15:53:47,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733734126] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:47,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1021468411] [2022-12-14 15:53:47,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:47,543 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:47,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:47,544 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:47,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (53)] Waiting until timeout for monitored process [2022-12-14 15:53:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:47,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:53:47,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 115 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 15:53:47,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 115 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 15:53:47,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1021468411] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:47,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205411744] [2022-12-14 15:53:47,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:47,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:47,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:47,866 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:47,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-14 15:53:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:47,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:53:47,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:48,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:48,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205411744] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:48,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:53:48,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 6 [2022-12-14 15:53:48,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694575225] [2022-12-14 15:53:48,111 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:48,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:53:48,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:48,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:53:48,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:53:48,112 INFO L87 Difference]: Start difference. First operand 69317 states and 100134 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:48,741 INFO L93 Difference]: Finished difference Result 71222 states and 102710 transitions. [2022-12-14 15:53:48,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:53:48,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-12-14 15:53:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:48,808 INFO L225 Difference]: With dead ends: 71222 [2022-12-14 15:53:48,808 INFO L226 Difference]: Without dead ends: 71222 [2022-12-14 15:53:48,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:53:48,808 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 342 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:48,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 473 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:53:48,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71222 states. [2022-12-14 15:53:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71222 to 65620. [2022-12-14 15:53:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65620 states, 65610 states have (on average 1.4398414875781131) internal successors, (94468), 65619 states have internal predecessors, (94468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65620 states to 65620 states and 94468 transitions. [2022-12-14 15:53:49,500 INFO L78 Accepts]: Start accepts. Automaton has 65620 states and 94468 transitions. Word has length 88 [2022-12-14 15:53:49,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:49,500 INFO L495 AbstractCegarLoop]: Abstraction has 65620 states and 94468 transitions. [2022-12-14 15:53:49,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 65620 states and 94468 transitions. [2022-12-14 15:53:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-14 15:53:49,503 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:49,503 INFO L195 NwaCegarLoop]: trace histogram [11, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:49,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Ended with exit code 0 [2022-12-14 15:53:49,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-12-14 15:53:49,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (53)] Ended with exit code 0 [2022-12-14 15:53:50,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:50,106 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:50,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:50,108 INFO L85 PathProgramCache]: Analyzing trace with hash 704457896, now seen corresponding path program 1 times [2022-12-14 15:53:50,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:50,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108876010] [2022-12-14 15:53:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:50,110 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 [2022-12-14 15:53:50,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:50,111 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:50,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (55)] Waiting until timeout for monitored process [2022-12-14 15:53:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:50,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 15:53:50,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:50,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:50,760 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:50,760 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:50,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108876010] [2022-12-14 15:53:50,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108876010] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:50,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [855467157] [2022-12-14 15:53:50,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:50,760 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:50,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:50,761 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:50,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (56)] Waiting until timeout for monitored process [2022-12-14 15:53:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:50,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:53:50,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 115 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 15:53:51,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 115 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 15:53:51,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [855467157] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:51,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698103469] [2022-12-14 15:53:51,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:51,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:51,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:51,157 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:51,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-14 15:53:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:51,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:53:51,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:51,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 26 proven. 106 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:53:51,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698103469] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:51,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:53:51,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 10 [2022-12-14 15:53:51,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027766077] [2022-12-14 15:53:51,545 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:51,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 15:53:51,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:51,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 15:53:51,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:53:51,546 INFO L87 Difference]: Start difference. First operand 65620 states and 94468 transitions. Second operand has 11 states, 10 states have (on average 13.2) internal successors, (132), 11 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:53,830 INFO L93 Difference]: Finished difference Result 69036 states and 99201 transitions. [2022-12-14 15:53:53,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 15:53:53,832 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.2) internal successors, (132), 11 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-12-14 15:53:53,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:53,906 INFO L225 Difference]: With dead ends: 69036 [2022-12-14 15:53:53,906 INFO L226 Difference]: Without dead ends: 69036 [2022-12-14 15:53:53,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 544 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=420, Invalid=986, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 15:53:53,907 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 1238 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:53,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 746 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 15:53:53,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69036 states. [2022-12-14 15:53:54,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69036 to 65621. [2022-12-14 15:53:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65621 states, 65611 states have (on average 1.4398347838014967) internal successors, (94469), 65620 states have internal predecessors, (94469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65621 states to 65621 states and 94469 transitions. [2022-12-14 15:53:54,649 INFO L78 Accepts]: Start accepts. Automaton has 65621 states and 94469 transitions. Word has length 90 [2022-12-14 15:53:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:54,649 INFO L495 AbstractCegarLoop]: Abstraction has 65621 states and 94469 transitions. [2022-12-14 15:53:54,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.2) internal successors, (132), 11 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 65621 states and 94469 transitions. [2022-12-14 15:53:54,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-14 15:53:54,652 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:54,652 INFO L195 NwaCegarLoop]: trace histogram [12, 6, 6, 6, 6, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:54,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (56)] Ended with exit code 0 [2022-12-14 15:53:54,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-12-14 15:53:55,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (55)] Ended with exit code 0 [2022-12-14 15:53:55,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:55,254 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:55,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:55,255 INFO L85 PathProgramCache]: Analyzing trace with hash 143187548, now seen corresponding path program 2 times [2022-12-14 15:53:55,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:55,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644205287] [2022-12-14 15:53:55,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 15:53:55,256 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 [2022-12-14 15:53:55,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:55,257 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:55,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Waiting until timeout for monitored process [2022-12-14 15:53:55,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 15:53:55,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:53:55,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 15:53:55,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 92 proven. 83 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 15:53:55,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 92 proven. 83 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 15:53:55,701 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:55,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644205287] [2022-12-14 15:53:55,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644205287] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:55,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2079741516] [2022-12-14 15:53:55,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 15:53:55,702 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:55,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:55,703 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:55,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (59)] Waiting until timeout for monitored process [2022-12-14 15:53:55,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 15:53:55,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:53:55,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 15:53:55,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 92 proven. 93 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 15:53:55,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 92 proven. 83 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 15:53:56,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2079741516] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:56,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027027193] [2022-12-14 15:53:56,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 15:53:56,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:53:56,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:53:56,081 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:53:56,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-12-14 15:53:56,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 15:53:56,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:53:56,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 15:53:56,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 92 proven. 83 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 15:53:56,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 92 proven. 83 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 15:53:56,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027027193] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:56,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:53:56,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9, 8, 8, 8] total 22 [2022-12-14 15:53:56,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077423837] [2022-12-14 15:53:56,400 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:53:56,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 15:53:56,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:53:56,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 15:53:56,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-12-14 15:53:56,400 INFO L87 Difference]: Start difference. First operand 65621 states and 94469 transitions. Second operand has 23 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 22 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:53:57,204 INFO L93 Difference]: Finished difference Result 114818 states and 160685 transitions. [2022-12-14 15:53:57,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-14 15:53:57,204 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 22 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-12-14 15:53:57,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:53:57,319 INFO L225 Difference]: With dead ends: 114818 [2022-12-14 15:53:57,319 INFO L226 Difference]: Without dead ends: 114818 [2022-12-14 15:53:57,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=556, Invalid=1796, Unknown=0, NotChecked=0, Total=2352 [2022-12-14 15:53:57,320 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 2006 mSDsluCounter, 1835 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:53:57,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2006 Valid, 2040 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:53:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114818 states. [2022-12-14 15:53:58,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114818 to 84826. [2022-12-14 15:53:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84826 states, 84816 states have (on average 1.4107243916242218) internal successors, (119652), 84825 states have internal predecessors, (119652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84826 states to 84826 states and 119652 transitions. [2022-12-14 15:53:58,326 INFO L78 Accepts]: Start accepts. Automaton has 84826 states and 119652 transitions. Word has length 90 [2022-12-14 15:53:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:53:58,327 INFO L495 AbstractCegarLoop]: Abstraction has 84826 states and 119652 transitions. [2022-12-14 15:53:58,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 22 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:53:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 84826 states and 119652 transitions. [2022-12-14 15:53:58,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-14 15:53:58,330 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:53:58,330 INFO L195 NwaCegarLoop]: trace histogram [13, 8, 7, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:53:58,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2022-12-14 15:53:58,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (59)] Ended with exit code 0 [2022-12-14 15:53:58,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Ended with exit code 0 [2022-12-14 15:53:58,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:53:58,933 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:53:58,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:53:58,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2003137351, now seen corresponding path program 1 times [2022-12-14 15:53:58,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:53:58,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779972624] [2022-12-14 15:53:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:58,937 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 [2022-12-14 15:53:58,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:53:58,938 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:53:58,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (61)] Waiting until timeout for monitored process [2022-12-14 15:53:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:53:59,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 15:53:59,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:53:59,155 INFO L350 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 13 treesize of output 9 [2022-12-14 15:53:59,162 INFO L350 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 13 treesize of output 9 [2022-12-14 15:53:59,441 INFO L350 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 19 treesize of output 7 [2022-12-14 15:53:59,444 INFO L350 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 19 treesize of output 7 [2022-12-14 15:53:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 67 proven. 142 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-14 15:53:59,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:53:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 46 proven. 163 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-14 15:53:59,968 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:53:59,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779972624] [2022-12-14 15:53:59,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779972624] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:53:59,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [955066018] [2022-12-14 15:53:59,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:53:59,969 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:53:59,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:53:59,970 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:53:59,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (62)] Waiting until timeout for monitored process [2022-12-14 15:54:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:54:00,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 15:54:00,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:54:00,404 INFO L350 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 13 treesize of output 9 [2022-12-14 15:54:00,412 INFO L350 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 13 treesize of output 9 [2022-12-14 15:54:00,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:54:00,710 INFO L350 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 19 treesize of output 19 [2022-12-14 15:54:00,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:54:00,728 INFO L350 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 19 treesize of output 19 [2022-12-14 15:54:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 76 proven. 148 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-14 15:54:01,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:54:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 46 proven. 157 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 15:54:01,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [955066018] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:54:01,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221768645] [2022-12-14 15:54:01,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:54:01,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:54:01,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:54:01,574 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:54:01,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-12-14 15:54:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:54:01,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 15:54:01,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:54:01,799 INFO L350 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 13 treesize of output 9 [2022-12-14 15:54:01,805 INFO L350 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 13 treesize of output 9 [2022-12-14 15:54:01,970 INFO L350 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 15 treesize of output 7 [2022-12-14 15:54:01,972 INFO L350 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 15 treesize of output 7 [2022-12-14 15:54:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 52 proven. 189 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 15:54:02,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:54:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 46 proven. 181 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 15:54:02,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221768645] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:54:02,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:54:02,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 7, 10, 9] total 21 [2022-12-14 15:54:02,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031614870] [2022-12-14 15:54:02,320 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:54:02,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 15:54:02,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:54:02,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 15:54:02,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:54:02,322 INFO L87 Difference]: Start difference. First operand 84826 states and 119652 transitions. Second operand has 22 states, 22 states have (on average 8.545454545454545) internal successors, (188), 21 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:54:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:54:57,325 INFO L93 Difference]: Finished difference Result 2729478 states and 3841914 transitions. [2022-12-14 15:54:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 560 states. [2022-12-14 15:54:57,326 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.545454545454545) internal successors, (188), 21 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-12-14 15:54:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:55:01,776 INFO L225 Difference]: With dead ends: 2729478 [2022-12-14 15:55:01,776 INFO L226 Difference]: Without dead ends: 2719729 [2022-12-14 15:55:01,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 561 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149602 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=24415, Invalid=291991, Unknown=0, NotChecked=0, Total=316406 [2022-12-14 15:55:01,797 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 5852 mSDsluCounter, 10424 mSDsCounter, 0 mSdLazyCounter, 5138 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5852 SdHoareTripleChecker+Valid, 10807 SdHoareTripleChecker+Invalid, 5599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 5138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:55:01,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5852 Valid, 10807 Invalid, 5599 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [461 Valid, 5138 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2022-12-14 15:55:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719729 states. [2022-12-14 15:55:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719729 to 1850288. [2022-12-14 15:55:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850288 states, 1850278 states have (on average 1.442049789274909) internal successors, (2668193), 1850287 states have internal predecessors, (2668193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850288 states to 1850288 states and 2668193 transitions. [2022-12-14 15:55:31,191 INFO L78 Accepts]: Start accepts. Automaton has 1850288 states and 2668193 transitions. Word has length 91 [2022-12-14 15:55:31,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:55:31,191 INFO L495 AbstractCegarLoop]: Abstraction has 1850288 states and 2668193 transitions. [2022-12-14 15:55:31,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.545454545454545) internal successors, (188), 21 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1850288 states and 2668193 transitions. [2022-12-14 15:55:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 15:55:31,197 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:55:31,197 INFO L195 NwaCegarLoop]: trace histogram [12, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:55:31,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (62)] Forceful destruction successful, exit code 0 [2022-12-14 15:55:31,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-12-14 15:55:31,628 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (61)] Ended with exit code 0 [2022-12-14 15:55:31,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,63 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:55:31,800 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:55:31,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:55:31,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1880956946, now seen corresponding path program 1 times [2022-12-14 15:55:31,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:55:31,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82824275] [2022-12-14 15:55:31,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:31,805 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 [2022-12-14 15:55:31,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:55:31,806 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:55:31,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (64)] Waiting until timeout for monitored process [2022-12-14 15:55:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:31,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 15:55:31,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 93 proven. 86 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 15:55:32,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 93 proven. 86 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 15:55:32,106 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:55:32,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82824275] [2022-12-14 15:55:32,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82824275] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:32,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [252384844] [2022-12-14 15:55:32,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:32,107 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:55:32,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:55:32,108 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:55:32,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (65)] Waiting until timeout for monitored process [2022-12-14 15:55:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:32,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 15:55:32,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 93 proven. 139 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 15:55:32,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 93 proven. 86 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 15:55:32,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [252384844] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:32,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073623305] [2022-12-14 15:55:32,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:32,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:55:32,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:55:32,507 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:55:32,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-12-14 15:55:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:32,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 15:55:32,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 59 proven. 124 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-14 15:55:32,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 123 proven. 11 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-12-14 15:55:32,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073623305] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:32,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:55:32,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 12, 8, 11, 8] total 23 [2022-12-14 15:55:32,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286453839] [2022-12-14 15:55:32,907 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:55:32,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 15:55:32,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:55:32,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 15:55:32,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-12-14 15:55:32,908 INFO L87 Difference]: Start difference. First operand 1850288 states and 2668193 transitions. Second operand has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 23 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:55:34,012 INFO L93 Difference]: Finished difference Result 115001 states and 150547 transitions. [2022-12-14 15:55:34,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 15:55:34,013 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 23 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-12-14 15:55:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:55:34,130 INFO L225 Difference]: With dead ends: 115001 [2022-12-14 15:55:34,130 INFO L226 Difference]: Without dead ends: 115001 [2022-12-14 15:55:34,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=384, Invalid=1968, Unknown=0, NotChecked=0, Total=2352 [2022-12-14 15:55:34,130 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 680 mSDsluCounter, 2366 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 2582 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:55:34,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 2582 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:55:34,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115001 states. [2022-12-14 15:55:34,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115001 to 28687. [2022-12-14 15:55:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28687 states, 28678 states have (on average 1.3265569426040869) internal successors, (38043), 28686 states have internal predecessors, (38043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28687 states to 28687 states and 38043 transitions. [2022-12-14 15:55:34,722 INFO L78 Accepts]: Start accepts. Automaton has 28687 states and 38043 transitions. Word has length 93 [2022-12-14 15:55:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:55:34,723 INFO L495 AbstractCegarLoop]: Abstraction has 28687 states and 38043 transitions. [2022-12-14 15:55:34,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 23 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:34,723 INFO L276 IsEmpty]: Start isEmpty. Operand 28687 states and 38043 transitions. [2022-12-14 15:55:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 15:55:34,726 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:55:34,726 INFO L195 NwaCegarLoop]: trace histogram [11, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:55:34,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (65)] Forceful destruction successful, exit code 0 [2022-12-14 15:55:34,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (64)] Ended with exit code 0 [2022-12-14 15:55:35,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2022-12-14 15:55:35,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,64 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,66 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:55:35,328 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:55:35,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:55:35,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1295142952, now seen corresponding path program 1 times [2022-12-14 15:55:35,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:55:35,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128146198] [2022-12-14 15:55:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:35,332 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 [2022-12-14 15:55:35,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:55:35,333 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:55:35,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (67)] Waiting until timeout for monitored process [2022-12-14 15:55:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:35,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 15:55:35,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:35,770 INFO L350 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 13 treesize of output 9 [2022-12-14 15:55:35,775 INFO L350 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 13 treesize of output 9 [2022-12-14 15:55:35,852 INFO L350 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 19 treesize of output 7 [2022-12-14 15:55:35,855 INFO L350 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 19 treesize of output 7 [2022-12-14 15:55:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-12-14 15:55:35,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-12-14 15:55:36,094 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:55:36,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128146198] [2022-12-14 15:55:36,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128146198] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:36,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [765231178] [2022-12-14 15:55:36,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:36,094 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:55:36,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:55:36,095 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:55:36,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (68)] Waiting until timeout for monitored process [2022-12-14 15:55:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:36,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 15:55:36,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:36,614 INFO L350 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 13 treesize of output 9 [2022-12-14 15:55:36,617 INFO L350 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 13 treesize of output 9 [2022-12-14 15:55:36,710 INFO L350 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 15 treesize of output 7 [2022-12-14 15:55:36,711 INFO L350 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 15 treesize of output 7 [2022-12-14 15:55:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 23 proven. 120 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 15:55:36,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-12-14 15:55:36,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [765231178] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:36,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544106774] [2022-12-14 15:55:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:36,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:55:36,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:55:36,933 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:55:36,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-12-14 15:55:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:37,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 15:55:37,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:37,293 INFO L350 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 13 treesize of output 9 [2022-12-14 15:55:37,296 INFO L350 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 13 treesize of output 9 [2022-12-14 15:55:37,370 INFO L350 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 15 treesize of output 7 [2022-12-14 15:55:37,372 INFO L350 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 15 treesize of output 7 [2022-12-14 15:55:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 23 proven. 111 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:55:37,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-12-14 15:55:37,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544106774] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:37,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:55:37,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9, 6, 9, 6] total 11 [2022-12-14 15:55:37,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639827055] [2022-12-14 15:55:37,641 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:55:37,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:55:37,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:55:37,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:55:37,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:55:37,642 INFO L87 Difference]: Start difference. First operand 28687 states and 38043 transitions. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 11 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:38,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:55:38,310 INFO L93 Difference]: Finished difference Result 42806 states and 56249 transitions. [2022-12-14 15:55:38,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:55:38,311 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 11 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-12-14 15:55:38,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:55:38,343 INFO L225 Difference]: With dead ends: 42806 [2022-12-14 15:55:38,343 INFO L226 Difference]: Without dead ends: 42806 [2022-12-14 15:55:38,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-12-14 15:55:38,344 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 238 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:55:38,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 522 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:55:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42806 states. [2022-12-14 15:55:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42806 to 35583. [2022-12-14 15:55:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35583 states, 35574 states have (on average 1.3237757913082588) internal successors, (47092), 35582 states have internal predecessors, (47092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35583 states to 35583 states and 47092 transitions. [2022-12-14 15:55:38,720 INFO L78 Accepts]: Start accepts. Automaton has 35583 states and 47092 transitions. Word has length 93 [2022-12-14 15:55:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:55:38,720 INFO L495 AbstractCegarLoop]: Abstraction has 35583 states and 47092 transitions. [2022-12-14 15:55:38,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 11 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:38,720 INFO L276 IsEmpty]: Start isEmpty. Operand 35583 states and 47092 transitions. [2022-12-14 15:55:38,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 15:55:38,723 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:55:38,723 INFO L195 NwaCegarLoop]: trace histogram [11, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:55:38,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (67)] Ended with exit code 0 [2022-12-14 15:55:38,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (68)] Forceful destruction successful, exit code 0 [2022-12-14 15:55:39,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-12-14 15:55:39,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,68 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,69 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:55:39,325 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:55:39,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:55:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1494724447, now seen corresponding path program 1 times [2022-12-14 15:55:39,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:55:39,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959597300] [2022-12-14 15:55:39,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:39,330 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 [2022-12-14 15:55:39,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:55:39,331 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:55:39,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (70)] Waiting until timeout for monitored process [2022-12-14 15:55:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:39,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 15:55:39,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:39,860 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_~garbage~0.base_36 (_ BitVec 32))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_~garbage~0.base_36) (_ bv0 1)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| v_~garbage~0.base_36 (_ bv0 1))))) is different from true [2022-12-14 15:55:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 69 trivial. 1 not checked. [2022-12-14 15:55:39,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:40,030 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_75 (_ BitVec 32))) (or (= (store |c_#valid| v_~x1~0.base_75 (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_75))))) is different from false [2022-12-14 15:55:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 69 trivial. 26 not checked. [2022-12-14 15:55:40,039 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:55:40,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959597300] [2022-12-14 15:55:40,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959597300] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:40,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [566954453] [2022-12-14 15:55:40,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:40,040 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:55:40,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:55:40,040 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:55:40,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (71)] Waiting until timeout for monitored process [2022-12-14 15:55:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:40,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 15:55:40,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-14 15:55:40,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:40,941 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_76 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_76))) (= (store |c_#valid| v_~x1~0.base_76 (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-12-14 15:55:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 60 trivial. 26 not checked. [2022-12-14 15:55:40,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [566954453] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:40,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058711013] [2022-12-14 15:55:40,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:40,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:55:40,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:55:40,951 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:55:40,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-12-14 15:55:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:41,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 15:55:41,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:41,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-12-14 15:55:41,189 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 15:55:41,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:41,286 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_77 (_ BitVec 32))) (or (= (store |c_#valid| v_~x1~0.base_77 (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_77))))) is different from false [2022-12-14 15:55:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 69 trivial. 26 not checked. [2022-12-14 15:55:41,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058711013] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:41,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:55:41,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6, 7, 7, 7] total 21 [2022-12-14 15:55:41,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675559647] [2022-12-14 15:55:41,295 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:55:41,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 15:55:41,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:55:41,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 15:55:41,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=257, Unknown=4, NotChecked=140, Total=462 [2022-12-14 15:55:41,296 INFO L87 Difference]: Start difference. First operand 35583 states and 47092 transitions. Second operand has 22 states, 21 states have (on average 10.476190476190476) internal successors, (220), 22 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:42,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:55:42,978 INFO L93 Difference]: Finished difference Result 91192 states and 121463 transitions. [2022-12-14 15:55:42,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:55:42,979 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 10.476190476190476) internal successors, (220), 22 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-12-14 15:55:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:55:43,052 INFO L225 Difference]: With dead ends: 91192 [2022-12-14 15:55:43,053 INFO L226 Difference]: Without dead ends: 91174 [2022-12-14 15:55:43,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 536 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 4 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=237, Invalid=705, Unknown=4, NotChecked=244, Total=1190 [2022-12-14 15:55:43,053 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 730 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1124 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:55:43,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 634 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 337 Invalid, 0 Unknown, 1124 Unchecked, 0.9s Time] [2022-12-14 15:55:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91174 states. [2022-12-14 15:55:43,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91174 to 64501. [2022-12-14 15:55:43,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64501 states, 64492 states have (on average 1.3319946660050859) internal successors, (85903), 64500 states have internal predecessors, (85903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:43,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64501 states to 64501 states and 85903 transitions. [2022-12-14 15:55:43,855 INFO L78 Accepts]: Start accepts. Automaton has 64501 states and 85903 transitions. Word has length 94 [2022-12-14 15:55:43,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:55:43,855 INFO L495 AbstractCegarLoop]: Abstraction has 64501 states and 85903 transitions. [2022-12-14 15:55:43,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 10.476190476190476) internal successors, (220), 22 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 64501 states and 85903 transitions. [2022-12-14 15:55:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-14 15:55:43,859 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:55:43,859 INFO L195 NwaCegarLoop]: trace histogram [12, 7, 7, 6, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:55:43,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (71)] Ended with exit code 0 [2022-12-14 15:55:44,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (70)] Ended with exit code 0 [2022-12-14 15:55:44,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2022-12-14 15:55:44,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,70 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,72 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:55:44,461 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:55:44,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:55:44,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1704695146, now seen corresponding path program 1 times [2022-12-14 15:55:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:55:44,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912171879] [2022-12-14 15:55:44,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:44,466 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 [2022-12-14 15:55:44,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:55:44,467 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:55:44,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (73)] Waiting until timeout for monitored process [2022-12-14 15:55:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:44,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 15:55:44,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 56 proven. 119 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 15:55:44,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 56 proven. 119 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 15:55:44,948 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:55:44,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912171879] [2022-12-14 15:55:44,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912171879] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:44,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [923536179] [2022-12-14 15:55:44,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:44,948 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:55:44,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:55:44,949 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:55:44,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (74)] Waiting until timeout for monitored process [2022-12-14 15:55:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:45,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 15:55:45,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 56 proven. 119 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 15:55:45,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 56 proven. 119 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 15:55:45,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [923536179] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:45,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654414192] [2022-12-14 15:55:45,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:45,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:55:45,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:55:45,329 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:55:45,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-12-14 15:55:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:45,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:55:45,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-12-14 15:55:45,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-12-14 15:55:45,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654414192] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 15:55:45,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 5 imperfect interpolant sequences. [2022-12-14 15:55:45,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9, 9, 9, 7] total 30 [2022-12-14 15:55:45,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880735420] [2022-12-14 15:55:45,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:55:45,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:55:45,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:55:45,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:55:45,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2022-12-14 15:55:45,605 INFO L87 Difference]: Start difference. First operand 64501 states and 85903 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:55:45,911 INFO L93 Difference]: Finished difference Result 113629 states and 149083 transitions. [2022-12-14 15:55:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:55:45,912 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-12-14 15:55:45,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:55:46,031 INFO L225 Difference]: With dead ends: 113629 [2022-12-14 15:55:46,031 INFO L226 Difference]: Without dead ends: 113629 [2022-12-14 15:55:46,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 15:55:46,032 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 151 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:55:46,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 495 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:55:46,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113629 states. [2022-12-14 15:55:46,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113629 to 67816. [2022-12-14 15:55:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67816 states, 67807 states have (on average 1.3289925818868258) internal successors, (90115), 67815 states have internal predecessors, (90115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67816 states to 67816 states and 90115 transitions. [2022-12-14 15:55:46,954 INFO L78 Accepts]: Start accepts. Automaton has 67816 states and 90115 transitions. Word has length 96 [2022-12-14 15:55:46,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:55:46,954 INFO L495 AbstractCegarLoop]: Abstraction has 67816 states and 90115 transitions. [2022-12-14 15:55:46,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:46,954 INFO L276 IsEmpty]: Start isEmpty. Operand 67816 states and 90115 transitions. [2022-12-14 15:55:46,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-14 15:55:46,959 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:55:46,960 INFO L195 NwaCegarLoop]: trace histogram [12, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:55:46,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (73)] Forceful destruction successful, exit code 0 [2022-12-14 15:55:47,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2022-12-14 15:55:47,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (74)] Ended with exit code 0 [2022-12-14 15:55:47,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,75 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,74 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 15:55:47,562 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:55:47,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:55:47,565 INFO L85 PathProgramCache]: Analyzing trace with hash 867335323, now seen corresponding path program 2 times [2022-12-14 15:55:47,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:55:47,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417889617] [2022-12-14 15:55:47,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 15:55:47,566 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 [2022-12-14 15:55:47,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:55:47,566 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:55:47,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (76)] Waiting until timeout for monitored process [2022-12-14 15:55:47,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 15:55:47,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:55:47,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 15:55:47,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 56 proven. 124 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 15:55:47,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 56 proven. 124 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 15:55:48,469 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:55:48,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417889617] [2022-12-14 15:55:48,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417889617] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:48,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1220675770] [2022-12-14 15:55:48,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 15:55:48,469 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:55:48,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:55:48,470 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:55:48,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (77)] Waiting until timeout for monitored process [2022-12-14 15:55:48,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 15:55:48,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:55:48,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 15:55:48,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 56 proven. 124 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 15:55:48,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 56 proven. 124 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 15:55:48,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1220675770] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:48,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374831537] [2022-12-14 15:55:48,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 15:55:48,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:55:48,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:55:48,944 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:55:48,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-12-14 15:55:49,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 15:55:49,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:55:49,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 15:55:49,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-14 15:55:49,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-14 15:55:49,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374831537] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:49,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:55:49,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9, 9, 9, 9] total 33 [2022-12-14 15:55:49,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543077847] [2022-12-14 15:55:49,332 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:55:49,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 15:55:49,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:55:49,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 15:55:49,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=895, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 15:55:49,334 INFO L87 Difference]: Start difference. First operand 67816 states and 90115 transitions. Second operand has 34 states, 34 states have (on average 8.205882352941176) internal successors, (279), 33 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:55:51,275 INFO L93 Difference]: Finished difference Result 127050 states and 161052 transitions. [2022-12-14 15:55:51,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-12-14 15:55:51,276 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 8.205882352941176) internal successors, (279), 33 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-12-14 15:55:51,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:55:51,377 INFO L225 Difference]: With dead ends: 127050 [2022-12-14 15:55:51,377 INFO L226 Difference]: Without dead ends: 127050 [2022-12-14 15:55:51,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2181 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1896, Invalid=5936, Unknown=0, NotChecked=0, Total=7832 [2022-12-14 15:55:51,378 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 4872 mSDsluCounter, 2612 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4872 SdHoareTripleChecker+Valid, 2869 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:55:51,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4872 Valid, 2869 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:55:51,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127050 states. [2022-12-14 15:55:52,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127050 to 90504. [2022-12-14 15:55:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90504 states, 90495 states have (on average 1.2881043151555334) internal successors, (116567), 90503 states have internal predecessors, (116567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90504 states to 90504 states and 116567 transitions. [2022-12-14 15:55:52,323 INFO L78 Accepts]: Start accepts. Automaton has 90504 states and 116567 transitions. Word has length 98 [2022-12-14 15:55:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:55:52,323 INFO L495 AbstractCegarLoop]: Abstraction has 90504 states and 116567 transitions. [2022-12-14 15:55:52,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.205882352941176) internal successors, (279), 33 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 90504 states and 116567 transitions. [2022-12-14 15:55:52,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-14 15:55:52,328 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:55:52,328 INFO L195 NwaCegarLoop]: trace histogram [17, 9, 9, 8, 8, 7, 7, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:55:52,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2022-12-14 15:55:52,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (76)] Ended with exit code 0 [2022-12-14 15:55:52,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (77)] Ended with exit code 0 [2022-12-14 15:55:52,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,76 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,77 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 15:55:52,931 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:55:52,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:55:52,934 INFO L85 PathProgramCache]: Analyzing trace with hash 274022558, now seen corresponding path program 1 times [2022-12-14 15:55:52,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:55:52,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485096046] [2022-12-14 15:55:52,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:52,935 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 [2022-12-14 15:55:52,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:55:52,936 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:55:52,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (79)] Waiting until timeout for monitored process [2022-12-14 15:55:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:53,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 15:55:53,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:53,322 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 247 proven. 95 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-12-14 15:55:53,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 247 proven. 95 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-12-14 15:55:53,368 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:55:53,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485096046] [2022-12-14 15:55:53,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485096046] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:53,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1877771386] [2022-12-14 15:55:53,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:53,368 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:55:53,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:55:53,369 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:55:53,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (80)] Waiting until timeout for monitored process [2022-12-14 15:55:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:53,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 15:55:53,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 247 proven. 95 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-12-14 15:55:53,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 247 proven. 95 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-12-14 15:55:53,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1877771386] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:53,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53689562] [2022-12-14 15:55:53,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:53,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:55:53,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:55:53,702 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:55:53,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-12-14 15:55:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:53,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 15:55:53,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 232 proven. 136 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-12-14 15:55:53,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 315 proven. 17 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-12-14 15:55:54,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53689562] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:54,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:55:54,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 12, 8] total 20 [2022-12-14 15:55:54,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675173580] [2022-12-14 15:55:54,093 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:55:54,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 15:55:54,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:55:54,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 15:55:54,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-14 15:55:54,094 INFO L87 Difference]: Start difference. First operand 90504 states and 116567 transitions. Second operand has 20 states, 20 states have (on average 7.6) internal successors, (152), 20 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:55:54,483 INFO L93 Difference]: Finished difference Result 7461 states and 8544 transitions. [2022-12-14 15:55:54,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 15:55:54,483 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.6) internal successors, (152), 20 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-12-14 15:55:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:55:54,487 INFO L225 Difference]: With dead ends: 7461 [2022-12-14 15:55:54,487 INFO L226 Difference]: Without dead ends: 7461 [2022-12-14 15:55:54,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=1037, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 15:55:54,488 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 824 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:55:54,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 2223 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:55:54,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7461 states. [2022-12-14 15:55:54,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7461 to 5148. [2022-12-14 15:55:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5148 states, 5139 states have (on average 1.1492508270091457) internal successors, (5906), 5147 states have internal predecessors, (5906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 5906 transitions. [2022-12-14 15:55:54,522 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 5906 transitions. Word has length 124 [2022-12-14 15:55:54,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:55:54,523 INFO L495 AbstractCegarLoop]: Abstraction has 5148 states and 5906 transitions. [2022-12-14 15:55:54,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.6) internal successors, (152), 20 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:55:54,523 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 5906 transitions. [2022-12-14 15:55:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-12-14 15:55:54,524 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:55:54,524 INFO L195 NwaCegarLoop]: trace histogram [18, 10, 10, 8, 8, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:55:54,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (80)] Ended with exit code 0 [2022-12-14 15:55:54,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2022-12-14 15:55:54,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (79)] Ended with exit code 0 [2022-12-14 15:55:55,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,81 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,79 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:55:55,126 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 15:55:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:55:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1230531958, now seen corresponding path program 1 times [2022-12-14 15:55:55,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:55:55,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87607885] [2022-12-14 15:55:55,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:55,129 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 [2022-12-14 15:55:55,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:55:55,131 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 15:55:55,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (82)] Waiting until timeout for monitored process [2022-12-14 15:55:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:55,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 15:55:55,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:55,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2022-12-14 15:55:55,579 INFO L350 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 13 treesize of output 9 [2022-12-14 15:55:55,586 INFO L350 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 13 treesize of output 9 [2022-12-14 15:55:55,896 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:55:55,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 13 [2022-12-14 15:55:55,930 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:55,939 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:55,945 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:55,954 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:56,070 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:56,076 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:56,184 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:56,187 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:56,242 INFO L350 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 19 treesize of output 7 [2022-12-14 15:55:56,245 INFO L350 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 19 treesize of output 7 [2022-12-14 15:55:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 86 proven. 389 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 15:55:56,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:56,423 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))))) is different from false [2022-12-14 15:55:57,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:55:57,306 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-12-14 15:55:57,310 INFO L350 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 36 treesize of output 24 [2022-12-14 15:55:57,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-12-14 15:55:57,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:55:57,325 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-12-14 15:55:57,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:55:57,329 INFO L350 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 20 treesize of output 8 [2022-12-14 15:55:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 56 proven. 245 refuted. 18 times theorem prover too weak. 48 trivial. 156 not checked. [2022-12-14 15:55:57,589 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:55:57,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87607885] [2022-12-14 15:55:57,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87607885] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:55:57,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [434786627] [2022-12-14 15:55:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:55:57,589 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:55:57,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:55:57,590 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:55:57,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (83)] Waiting until timeout for monitored process [2022-12-14 15:55:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:55:57,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 15:55:57,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:55:57,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2022-12-14 15:55:58,145 INFO L350 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 13 treesize of output 9 [2022-12-14 15:55:58,159 INFO L350 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 13 treesize of output 9 [2022-12-14 15:55:58,566 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:55:58,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 13 [2022-12-14 15:55:58,620 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:58,626 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:58,639 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:58,647 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:58,697 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:58,706 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:58,838 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:58,844 INFO L350 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 16 treesize of output 18 [2022-12-14 15:55:58,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:55:58,933 INFO L350 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 19 treesize of output 19 [2022-12-14 15:55:58,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:55:58,951 INFO L350 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 19 treesize of output 19 [2022-12-14 15:55:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 86 proven. 381 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-14 15:55:59,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:55:59,632 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))))) is different from false [2022-12-14 15:56:00,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:56:00,249 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-12-14 15:56:00,251 INFO L350 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 36 treesize of output 24 [2022-12-14 15:56:00,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-12-14 15:56:00,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:56:00,269 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-12-14 15:56:00,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:56:00,272 INFO L350 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 20 treesize of output 8 [2022-12-14 15:56:00,478 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 56 proven. 237 refuted. 18 times theorem prover too weak. 56 trivial. 156 not checked. [2022-12-14 15:56:00,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [434786627] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:56:00,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090882469] [2022-12-14 15:56:00,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:56:00,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:56:00,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:56:00,479 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:56:00,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-12-14 15:56:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:56:00,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 15:56:00,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:56:00,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2022-12-14 15:56:00,827 INFO L350 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 13 treesize of output 9 [2022-12-14 15:56:00,831 INFO L350 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 13 treesize of output 9 [2022-12-14 15:56:01,149 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:56:01,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 13 [2022-12-14 15:56:01,202 INFO L350 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 14 treesize of output 16 [2022-12-14 15:56:01,210 INFO L350 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 14 treesize of output 16 [2022-12-14 15:56:01,218 INFO L350 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 14 treesize of output 16 [2022-12-14 15:56:01,224 INFO L350 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 14 treesize of output 16 [2022-12-14 15:56:01,267 INFO L350 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 14 treesize of output 16 [2022-12-14 15:56:01,274 INFO L350 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 14 treesize of output 16 [2022-12-14 15:56:01,352 INFO L350 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 14 treesize of output 16 [2022-12-14 15:56:01,356 INFO L350 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 14 treesize of output 16 [2022-12-14 15:56:01,427 INFO L350 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 15 treesize of output 7 [2022-12-14 15:56:01,429 INFO L350 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 15 treesize of output 7 [2022-12-14 15:56:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 62 proven. 424 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-14 15:56:01,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:56:01,856 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_~x1~0.base_89 (_ BitVec 32))) (or (not (= (select |c_#valid| v_~x1~0.base_89) (_ bv0 1))) (forall ((v_ArrVal_2309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_89 v_ArrVal_2309) c_~t4~0.base) .cse0))))) (forall ((v_~x1~0.base_89 (_ BitVec 32))) (or (not (= (select |c_#valid| v_~x1~0.base_89) (_ bv0 1))) (forall ((v_ArrVal_2308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_89 v_ArrVal_2308) c_~t4~0.base) .cse0) (_ bv0 32))))))) is different from false [2022-12-14 15:56:02,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:56:02,455 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-12-14 15:56:02,457 INFO L350 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 36 treesize of output 24 [2022-12-14 15:56:02,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-12-14 15:56:02,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:56:02,471 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-12-14 15:56:02,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:56:02,475 INFO L350 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 20 treesize of output 8 [2022-12-14 15:56:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 56 proven. 277 refuted. 9 times theorem prover too weak. 37 trivial. 144 not checked. [2022-12-14 15:56:02,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090882469] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:56:02,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:56:02,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10, 10, 12, 12] total 36 [2022-12-14 15:56:02,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220315223] [2022-12-14 15:56:02,750 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:56:02,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 15:56:02,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:56:02,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 15:56:02,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=997, Unknown=21, NotChecked=198, Total=1332 [2022-12-14 15:56:02,751 INFO L87 Difference]: Start difference. First operand 5148 states and 5906 transitions. Second operand has 37 states, 37 states have (on average 9.891891891891891) internal successors, (366), 36 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:56:13,615 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_~x1~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (= c_~t4~0.offset (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse0) (_ bv0 32))))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (not (= c_~t4~0.base c_~x1~0.base)))) is different from false [2022-12-14 15:56:15,662 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (not (= c_~S~0.offset c_~t4~0.offset))) (.cse2 (not (= c_~S~0.base c_~t4~0.base))) (.cse3 (bvadd (_ bv4 32) c_~x1~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (or .cse1 .cse2 (= c_~x4~0.offset (_ bv0 32))) (not (= c_~S~0.base c_~x1~0.base)) (or .cse1 .cse2 (= c_~x4~0.base (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse3) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (= c_~t4~0.offset (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse3) (_ bv0 32))))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (= c_~S~0.offset (_ bv0 32)) (not (= c_~t4~0.base c_~x1~0.base)))) is different from false [2022-12-14 15:56:18,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:56:21,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:56:22,562 WARN L837 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (= c_~t4~0.offset (_ bv0 32)) (or (not (= c_~S~0.base c_~t1~0.base)) (let ((.cse0 (bvadd (_ bv4 32) c_~x1~0.offset))) (and (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse0) (_ bv0 32))))))) (not (= c_~S~0.offset c_~t1~0.offset))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) (_ bv4 32)) (_ bv0 32))) is different from false [2022-12-14 15:56:25,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:56:31,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:56:35,899 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (not (= c_~S~0.offset c_~t4~0.offset))) (.cse2 (not (= c_~S~0.base c_~t4~0.base)))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (or .cse1 .cse2 (= c_~x4~0.offset (_ bv0 32))) (not (= c_~S~0.base c_~x1~0.base)) (or .cse1 .cse2 (= c_~x4~0.base (_ bv0 32))) (or (not (= c_~S~0.base c_~t1~0.base)) (let ((.cse3 (bvadd (_ bv4 32) c_~x1~0.offset))) (and (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse3) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse3) (_ bv0 32))))))) (not (= c_~S~0.offset c_~t1~0.offset))) (= c_~S~0.offset (_ bv0 32)))) is different from false [2022-12-14 15:56:40,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:56:42,853 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd c_~S~0.offset (_ bv4 32))) (.cse0 (not (= c_~S~0.offset c_~t4~0.offset))) (.cse1 (not (= c_~S~0.base c_~t4~0.base)))) (and (or .cse0 .cse1 (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse2) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse2)) (or .cse0 .cse1 (= c_~x4~0.offset (_ bv0 32))) (not (= c_~S~0.base c_~x1~0.base)) (or .cse0 .cse1 (= c_~x4~0.base (_ bv0 32))) (= c_~t4~0.offset (_ bv0 32)) (or (not (= c_~S~0.base c_~t1~0.base)) (let ((.cse3 (bvadd (_ bv4 32) c_~x1~0.offset))) (and (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse3) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse3) (_ bv0 32))))))) (not (= c_~S~0.offset c_~t1~0.offset))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (= c_~S~0.offset (_ bv0 32)) (or (= |c_ULTIMATE.start_pop_#t~mem8#1.base| (_ bv0 32)) .cse0 .cse1))) is different from false [2022-12-14 15:56:50,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:56:52,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:56:54,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:56:58,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:57:00,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:57:06,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:57:07,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:57:09,402 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~t4~0.base) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (or (not (= c_~S~0.offset c_~t4~0.offset)) (not (= c_~S~0.base c_~t4~0.base)) (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| (_ bv0 32)) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| (_ bv0 32)))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= c_~x4~0.offset (_ bv0 32)) (= c_~t4~0.offset (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))))) is different from false [2022-12-14 15:57:12,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:57:14,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:57:15,609 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse2) (_ bv0 32))) (= c_~t4~0.offset (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse1) (_ bv0 32))))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse2) (_ bv0 32))))) is different from false [2022-12-14 15:57:18,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:57:20,279 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse2) (_ bv0 32))) (= c_~t4~0.offset (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse1) (_ bv0 32))))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse2) (_ bv0 32))))) is different from false [2022-12-14 15:57:20,550 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (= (_ bv0 32) c_~t1~0.offset) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~t4~0.base) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (= c_~x1~0.offset (_ bv0 32)) (or (not (= c_~S~0.offset c_~t4~0.offset)) (not (= c_~S~0.base c_~t4~0.base)) (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| (_ bv0 32)) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| (_ bv0 32)))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (= c_~x4~0.offset (_ bv0 32)) (= c_~t4~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |c_#valid| c_~x1~0.base) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))) (= c_~t1~0.base (_ bv0 32)))) is different from false [2022-12-14 15:57:24,766 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= c_~t4~0.offset (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))))) is different from false [2022-12-14 15:57:37,216 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd c_~S~0.offset (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2309) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~S~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse1) (_ bv0 32))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~S~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse1))) (forall ((v_ArrVal_2308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2308) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))))) is different from false [2022-12-14 15:57:37,426 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd c_~S~0.offset (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2309) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse1) (_ bv0 32))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse1))) (forall ((v_ArrVal_2308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2308) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))))) is different from false [2022-12-14 15:57:37,642 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse1 (bvadd c_~S~0.offset (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2309) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse1) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse2) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse2) (_ bv0 32))))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse1))) (forall ((v_ArrVal_2308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2308) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))))) is different from false [2022-12-14 15:57:40,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:57:42,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:57:45,690 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (= (_ bv0 32) c_~t1~0.offset) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (= c_~x1~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (= c_~x4~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |c_#valid| c_~x1~0.base) (_ bv1 1))) (= c_~x4~0.base (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (= c_~t1~0.base (_ bv0 32)))) is different from false [2022-12-14 15:57:48,068 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse1) (_ bv0 32))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))))) is different from false [2022-12-14 15:57:48,814 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse1) (_ bv0 32))))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))))) is different from false [2022-12-14 15:57:57,765 WARN L233 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 59 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:58:01,822 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (= (_ bv0 32) c_~t1~0.offset) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (= c_~x1~0.offset (_ bv0 32)) (= c_~t4~0.base (_ bv0 32)) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (= c_~x4~0.offset (_ bv0 32)) (= c_~t4~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |c_#valid| c_~x1~0.base) (_ bv1 1))) (= c_~x4~0.base (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (= c_~t1~0.base (_ bv0 32)))) is different from false [2022-12-14 15:58:02,282 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (= (_ bv0 32) c_~t1~0.offset) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (= c_~x1~0.offset (_ bv0 32)) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (= c_~x4~0.offset (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |c_#valid| c_~x1~0.base) (_ bv1 1))) (= c_~x4~0.base (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))) (= c_~t1~0.base (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))))) is different from false [2022-12-14 15:58:03,061 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) (_ bv0 32)) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))))) is different from false [2022-12-14 15:58:03,891 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse2) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse2) (_ bv0 32))))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))))) is different from false [2022-12-14 15:58:11,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:58:20,293 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2309) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2308) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))))) is different from false [2022-12-14 15:58:20,662 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= c_~S~0.offset c_~t4~0.offset))) (.cse3 (not (= c_~S~0.base c_~t4~0.base))) (.cse1 (bvadd c_~S~0.offset (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2309) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~S~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse1) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse0) (_ bv0 32)) (or .cse2 .cse3 (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| (_ bv0 32)) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| (_ bv0 32)))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (or .cse2 .cse3 (and (= c_~x4~0.offset (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse0) (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~S~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse1))) (forall ((v_ArrVal_2308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2308) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))))) is different from false [2022-12-14 15:58:21,911 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2309) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2308) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))))) is different from false [2022-12-14 15:58:29,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:58:31,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:58:33,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:58:35,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:58:37,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:58:43,624 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2309) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse1) (_ bv0 32))))) (forall ((v_ArrVal_2308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2308) c_~t4~0.base) .cse0) (_ bv0 32))))) is different from false [2022-12-14 15:58:43,742 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (not (= c_~S~0.offset c_~t4~0.offset))) (.cse2 (not (= c_~S~0.base c_~t4~0.base)))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (or .cse1 .cse2 (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| (_ bv0 32)) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| (_ bv0 32)))) (or .cse1 .cse2 (and (= c_~x4~0.offset (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)))) (= c_~t4~0.offset (_ bv0 32)) (or (not (= c_~S~0.base c_~t1~0.base)) (let ((.cse3 (bvadd (_ bv4 32) c_~x1~0.offset))) (and (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse3) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse3) (_ bv0 32))))))) (not (= c_~S~0.offset c_~t1~0.offset))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (not (= c_~t4~0.base c_~x1~0.base)))) is different from false [2022-12-14 15:58:48,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:58:51,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:58:56,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:02,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:05,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:07,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:09,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:14,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:16,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:22,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:24,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:26,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:27,651 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (= (_ bv0 32) c_~t1~0.offset) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~t4~0.base) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (= c_~x1~0.offset (_ bv0 32)) (or (not (= c_~S~0.offset c_~t4~0.offset)) (not (= c_~S~0.base c_~t4~0.base)) (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| (_ bv0 32)) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| (_ bv0 32)))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (= c_~x4~0.offset (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |c_#valid| c_~x1~0.base) (_ bv1 1))) (= c_~x4~0.base (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))) (= c_~t1~0.base (_ bv0 32)))) is different from false [2022-12-14 15:59:27,771 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= c_~S~0.offset c_~t4~0.offset))) (.cse2 (not (= c_~S~0.base c_~t4~0.base))) (.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~t4~0.base) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (or .cse1 .cse2 (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| (_ bv0 32)) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| (_ bv0 32)))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse3) (_ bv0 32))) (or .cse1 .cse2 (and (= c_~x4~0.offset (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)))) (= c_~t4~0.offset (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse3) (_ bv0 32))))) is different from false [2022-12-14 15:59:28,304 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= c_~S~0.offset c_~t4~0.offset))) (.cse3 (not (= c_~S~0.base c_~t4~0.base))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset)) (.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) (_ bv0 32)) (or .cse2 .cse3 (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| (_ bv0 32)) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| (_ bv0 32)))) (or .cse2 .cse3 (and (= c_~x4~0.offset (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))))) is different from false [2022-12-14 15:59:31,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:33,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:37,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:39,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:42,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:44,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:46,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:51,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:54,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:59:59,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:03,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:05,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:07,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:09,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:10,015 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (= (_ bv0 32) c_~t1~0.offset) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (= c_~x1~0.offset (_ bv0 32)) (or (not (= c_~S~0.offset c_~t4~0.offset)) (not (= c_~S~0.base c_~t4~0.base)) (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| (_ bv0 32)) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| (_ bv0 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (= c_~x4~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |c_#valid| c_~x1~0.base) (_ bv1 1))) (= c_~x4~0.base (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (= c_~t1~0.base (_ bv0 32)))) is different from false [2022-12-14 16:00:12,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:14,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:15,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:17,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:19,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:21,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:23,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:25,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:27,541 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (= (_ bv0 32) c_~t1~0.offset) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= c_~x1~0.offset (_ bv0 32)) (= c_~x4~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |c_#valid| c_~x1~0.base) (_ bv1 1))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (= c_~x4~0.base (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (= c_~t1~0.base (_ bv0 32)))) is different from false [2022-12-14 16:00:27,660 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= c_~S~0.offset c_~t4~0.offset))) (.cse2 (not (= c_~S~0.base c_~t4~0.base))) (.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (or .cse1 .cse2 (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| (_ bv0 32)) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| (_ bv0 32)))) (or .cse1 .cse2 (and (= c_~x4~0.offset (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))))) is different from false [2022-12-14 16:00:33,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:36,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:38,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:40,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:45,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:47,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:50,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:00:51,920 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= c_~S~0.offset c_~t4~0.offset))) (.cse3 (not (= c_~S~0.base c_~t4~0.base))) (.cse4 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~t4~0.base) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (or .cse2 .cse3 (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| (_ bv0 32)) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| (_ bv0 32)))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse4) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (or .cse2 .cse3 (and (= c_~x4~0.offset (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse4) (_ bv0 32))))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))))) is different from false [2022-12-14 16:00:58,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:01:07,128 WARN L233 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 61 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 16:01:07,471 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~t4~0.base) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse2) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse2) (_ bv0 32))))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))))) is different from false [2022-12-14 16:01:08,061 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd c_~S~0.offset (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2309) c_~t4~0.base) .cse0) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse1) (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse1) (_ bv0 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse1)) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse1))) (forall ((v_ArrVal_2308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2308) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))))) is different from false [2022-12-14 16:01:14,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:01:17,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:01:18,502 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (or (not (= c_~S~0.offset c_~t4~0.offset)) (not (= c_~S~0.base c_~t4~0.base)) (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| (_ bv0 32)) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| (_ bv0 32)))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (= c_~x4~0.offset (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse1) (_ bv0 32))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (= c_~x4~0.base (_ bv0 32)))) is different from false [2022-12-14 16:01:22,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:01:24,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:01:34,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:01:41,606 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 16:01:41,804 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= c_~x4~0.offset (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))))) is different from false [2022-12-14 16:01:44,838 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse1 (bvadd c_~S~0.offset (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~S~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse2) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (= c_~x4~0.offset (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse2) (_ bv0 32))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~S~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (= c_~x4~0.base (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))))) is different from false [2022-12-14 16:01:49,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:01:51,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:01:53,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:01:55,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:01:57,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:01:59,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:02:01,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:02:03,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:02:04,306 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd c_~S~0.offset (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~S~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (or (not (= c_~S~0.offset c_~t4~0.offset)) (not (= c_~S~0.base c_~t4~0.base)) (and (= c_~x4~0.offset (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~S~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))))) is different from false [2022-12-14 16:02:04,455 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd c_~S~0.offset (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2309) c_~t4~0.base) .cse0) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse1) (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse1) (_ bv0 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse1)) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (= c_~x4~0.offset (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse1))) (forall ((v_ArrVal_2308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2308) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))))) is different from false [2022-12-14 16:02:05,987 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~t4~0.base) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse2) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse2) (_ bv0 32))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))))) is different from false [2022-12-14 16:02:11,907 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= c_~S~0.offset c_~t4~0.offset))) (.cse2 (not (= c_~S~0.base c_~t4~0.base))) (.cse3 (= c_~x4~0.offset (_ bv0 32))) (.cse5 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse4 (= c_~x4~0.base (_ bv0 32))) (.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (or .cse1 .cse2 .cse3) (not (= c_~S~0.base c_~x1~0.base)) (or .cse1 .cse2 .cse4) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse5) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) .cse3 (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse5) (_ bv0 32))))) .cse4 (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (= c_~S~0.offset (_ bv0 32)))) is different from false [2022-12-14 16:02:16,776 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= c_~S~0.offset c_~t4~0.offset))) (.cse2 (not (= c_~S~0.base c_~t4~0.base))) (.cse3 (= c_~x4~0.offset (_ bv0 32))) (.cse4 (= c_~x4~0.base (_ bv0 32))) (.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2309) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (= c_~x1~0.offset (_ bv0 32)) (or .cse1 .cse2 .cse3) (= c_~S~0.base (_ bv0 32)) (or .cse1 .cse2 .cse4) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) .cse3 (= (_ bv0 1) (bvadd (select |c_#valid| c_~x1~0.base) (_ bv1 1))) .cse4 (= c_~S~0.offset (_ bv0 32)) (forall ((v_ArrVal_2308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2308) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))))) is different from false [2022-12-14 16:02:18,505 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= c_~t4~0.base (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (= c_~x4~0.offset (_ bv0 32)) (= c_~t4~0.offset (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse1) (_ bv0 32))))) (= c_~x4~0.base (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))))) is different from false [2022-12-14 16:02:18,516 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2309) c_~t4~0.base) .cse0) (_ bv0 32))) (= c_~x1~0.offset (_ bv0 32)) (= c_~S~0.base (_ bv0 32)) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~x1~0.base) (_ bv1 1))) (= c_~S~0.offset (_ bv0 32)) (forall ((v_ArrVal_2308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2308) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))))) is different from false [2022-12-14 16:02:20,081 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2309) c_~t4~0.base) .cse0) (_ bv0 32))) (= c_~x1~0.offset (_ bv0 32)) (= c_~S~0.base (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse1) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse1) (_ bv0 32))))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~x1~0.base) (_ bv1 1))) (= c_~S~0.offset (_ bv0 32)) (forall ((v_ArrVal_2308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2308) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))))) is different from false [2022-12-14 16:02:23,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:02:27,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:02:33,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:02:37,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:02:40,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:02:42,357 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (not (= c_~S~0.offset c_~t4~0.offset))) (.cse2 (not (= c_~S~0.base c_~t4~0.base))) (.cse3 (bvadd (_ bv4 32) c_~x1~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (or .cse1 .cse2 (= c_~x4~0.offset (_ bv0 32))) (not (= c_~S~0.base c_~x1~0.base)) (or .cse1 .cse2 (= c_~x4~0.base (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse3) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse3) (_ bv0 32))))) (= c_~S~0.offset (_ bv0 32)))) is different from false [2022-12-14 16:02:43,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:02:46,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:02:52,087 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (= c_~t4~0.base (_ bv0 32)) (= c_~t4~0.offset (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))))) is different from false [2022-12-14 16:02:53,233 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2309) c_~t4~0.base) .cse0) (_ bv0 32))) (= (_ bv0 32) c_~t1~0.offset) (= c_~x1~0.offset (_ bv0 32)) (= c_~S~0.base (_ bv0 32)) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~x1~0.base) (_ bv1 1))) (= c_~S~0.offset (_ bv0 32)) (forall ((v_ArrVal_2308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2308) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (= c_~t1~0.base (_ bv0 32)))) is different from false [2022-12-14 16:02:59,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:03:02,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:03:15,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:03:18,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:03:20,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:03:22,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:03:26,050 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~t4~0.base) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (= c_~x4~0.offset (_ bv0 32)) (= c_~t4~0.offset (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))))) is different from false [2022-12-14 16:03:31,690 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= c_~t4~0.base (_ bv0 32)) (= c_~t4~0.offset (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))))) is different from false [2022-12-14 16:03:36,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:03:47,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:03:47,283 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd c_~S~0.offset (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2309) c_~t4~0.base) .cse0) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse1) (_ bv0 32)) (= (_ bv0 32) c_~t1~0.offset) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse1) (_ bv0 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse1)) (= c_~x1~0.offset (_ bv0 32)) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~x1~0.base) (_ bv1 1))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse1))) (forall ((v_ArrVal_2308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2308) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (= c_~t1~0.base (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~t4~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))))) is different from false [2022-12-14 16:03:52,411 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= c_~S~0.offset c_~t4~0.offset))) (.cse3 (not (= c_~S~0.base c_~t4~0.base))) (.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (= (_ bv0 32) c_~t1~0.offset) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~t4~0.base) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (= c_~x1~0.offset (_ bv0 32)) (or .cse2 .cse3 (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| (_ bv0 32)) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| (_ bv0 32)))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (or .cse2 .cse3 (and (= c_~x4~0.offset (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |c_#valid| c_~x1~0.base) (_ bv1 1))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))) (= c_~t1~0.base (_ bv0 32)))) is different from false [2022-12-14 16:03:56,570 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~t4~0.base) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (or (not (= c_~S~0.offset c_~t4~0.offset)) (not (= c_~S~0.base c_~t4~0.base)) (and (= c_~x4~0.offset (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)))) (= c_~t4~0.offset (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) (_ bv4 32)) (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))))) is different from false [2022-12-14 16:04:11,522 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~t4~0.base) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (or (not (= c_~S~0.offset c_~t4~0.offset)) (not (= c_~S~0.base c_~t4~0.base)) (and (= |c_ULTIMATE.start_pop_#t~mem8#1.base| (_ bv0 32)) (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| (_ bv0 32)))) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (= c_~x4~0.offset (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))))) is different from false [2022-12-14 16:04:23,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:04:30,265 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd c_~S~0.offset (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse0 (not (= c_~S~0.offset c_~t4~0.offset))) (.cse1 (not (= c_~S~0.base c_~t4~0.base)))) (and (or .cse0 .cse1 (= |c_ULTIMATE.start_pop_#t~mem8#1.offset| (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse2) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse2)) (or .cse0 .cse1 (= c_~x4~0.offset (_ bv0 32))) (not (= c_~S~0.base c_~x1~0.base)) (or .cse0 .cse1 (= c_~x4~0.base (_ bv0 32))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~x1~0.base) .cse3) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~x1~0.base) .cse3) (_ bv0 32))))) (= c_~S~0.offset (_ bv0 32)) (or (= |c_ULTIMATE.start_pop_#t~mem8#1.base| (_ bv0 32)) .cse0 .cse1))) is different from false [2022-12-14 16:04:39,899 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~t4~0.base) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (= c_~x4~0.offset (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))))) is different from false [2022-12-14 16:04:46,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:04:48,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:04:50,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:04:50,974 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_~t4~0.offset)) (.cse0 (bvadd c_~S~0.offset (_ bv4 32)))) (and (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_85 v_ArrVal_2166) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) (_ bv0 32)) (or (not (= c_~S~0.offset c_~t4~0.offset)) (not (= c_~S~0.base c_~t4~0.base)) (and (= c_~x4~0.offset (_ bv0 32)) (= c_~x4~0.base (_ bv0 32)))) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) (_ bv0 32)) (forall ((v_~x1~0.base_85 (_ BitVec 32))) (or (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_85 v_ArrVal_2167) c_~S~0.base) .cse0) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_85))))) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))))) is different from false [2022-12-14 16:04:53,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:04:56,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:04:58,737 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_~S~0.offset (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_~S~0.base) .cse0) (_ bv0 32)) (= (_ bv0 32) c_~t1~0.offset) (forall ((v_ArrVal_2238 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2238) c_~S~0.base) .cse0) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~t4~0.base) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.base| c_~t4~0.base) .cse1) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_~S~0.base) .cse0)) (= c_~x1~0.offset (_ bv0 32)) (forall ((v_ArrVal_2167 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2167) c_~t4~0.base) .cse1) (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1))) (= c_~x4~0.offset (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| c_~t4~0.base) .cse1) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |c_#valid| c_~x1~0.base) (_ bv1 1))) (= c_~x4~0.base (_ bv0 32)) (forall ((v_ArrVal_2237 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2237) c_~S~0.base) .cse0))) (not (= c_~t4~0.base c_~x1~0.base)) (forall ((v_ArrVal_2166 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2166) c_~t4~0.base) .cse1) (_ bv0 32))) (= c_~t1~0.base (_ bv0 32)))) is different from false [2022-12-14 16:05:00,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:05:02,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:05:04,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:05:06,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:05:08,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:05:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:05:10,381 INFO L93 Difference]: Finished difference Result 68890 states and 78315 transitions. [2022-12-14 16:05:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 795 states. [2022-12-14 16:05:10,382 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 9.891891891891891) internal successors, (366), 36 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2022-12-14 16:05:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:05:10,430 INFO L225 Difference]: With dead ends: 68890 [2022-12-14 16:05:10,430 INFO L226 Difference]: Without dead ends: 68890 [2022-12-14 16:05:10,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1589 GetRequests, 722 SyntacticMatches, 60 SemanticMatches, 807 ConstructedPredicates, 61 IntricatePredicates, 25 DeprecatedPredicates, 287809 ImplicationChecksByTransitivity, 275.1s TimeCoverageRelationStatistics Valid=40391, Invalid=516807, Unknown=1802, NotChecked=94672, Total=653672 [2022-12-14 16:05:10,479 INFO L413 NwaCegarLoop]: 734 mSDtfsCounter, 5492 mSDsluCounter, 13476 mSDsCounter, 0 mSdLazyCounter, 8105 mSolverCounterSat, 592 mSolverCounterUnsat, 1424 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 267.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5492 SdHoareTripleChecker+Valid, 14210 SdHoareTripleChecker+Invalid, 14003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 8105 IncrementalHoareTripleChecker+Invalid, 1424 IncrementalHoareTripleChecker+Unknown, 3882 IncrementalHoareTripleChecker+Unchecked, 271.3s IncrementalHoareTripleChecker+Time [2022-12-14 16:05:10,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5492 Valid, 14210 Invalid, 14003 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [592 Valid, 8105 Invalid, 1424 Unknown, 3882 Unchecked, 271.3s Time] [2022-12-14 16:05:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68890 states. [2022-12-14 16:05:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68890 to 38026. [2022-12-14 16:05:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38026 states, 38017 states have (on average 1.155956545755846) internal successors, (43946), 38025 states have internal predecessors, (43946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:05:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38026 states to 38026 states and 43946 transitions. [2022-12-14 16:05:10,920 INFO L78 Accepts]: Start accepts. Automaton has 38026 states and 43946 transitions. Word has length 126 [2022-12-14 16:05:10,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:05:10,920 INFO L495 AbstractCegarLoop]: Abstraction has 38026 states and 43946 transitions. [2022-12-14 16:05:10,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 9.891891891891891) internal successors, (366), 36 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:05:10,921 INFO L276 IsEmpty]: Start isEmpty. Operand 38026 states and 43946 transitions. [2022-12-14 16:05:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-12-14 16:05:10,926 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:05:10,926 INFO L195 NwaCegarLoop]: trace histogram [18, 10, 10, 8, 8, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:05:10,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (83)] Ended with exit code 0 [2022-12-14 16:05:11,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2022-12-14 16:05:11,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (82)] Ended with exit code 0 [2022-12-14 16:05:11,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,84 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,82 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 16:05:11,528 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-14 16:05:11,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:05:11,529 INFO L85 PathProgramCache]: Analyzing trace with hash -859895564, now seen corresponding path program 2 times [2022-12-14 16:05:11,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 16:05:11,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513962972] [2022-12-14 16:05:11,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 16:05:11,530 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 [2022-12-14 16:05:11,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 16:05:11,531 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -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) [2022-12-14 16:05:11,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (85)] Waiting until timeout for monitored process [2022-12-14 16:05:11,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 16:05:11,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 16:05:11,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 16:05:11,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:05:11,973 INFO L350 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 13 treesize of output 9 [2022-12-14 16:05:11,983 INFO L350 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 13 treesize of output 9 [2022-12-14 16:05:12,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2022-12-14 16:05:12,263 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 16:05:12,263 INFO L350 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 16 treesize of output 22 [2022-12-14 16:05:12,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2022-12-14 16:05:12,297 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 16:05:12,297 INFO L350 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 16 treesize of output 22 [2022-12-14 16:05:12,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2022-12-14 16:05:12,366 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 16:05:12,367 INFO L350 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 20 treesize of output 26 [2022-12-14 16:05:12,392 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 16:05:12,392 INFO L350 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 20 treesize of output 26 [2022-12-14 16:05:12,877 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 16:05:12,878 INFO L350 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 18 treesize of output 24 [2022-12-14 16:05:12,903 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 16:05:12,903 INFO L350 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 18 treesize of output 24 [2022-12-14 16:05:13,245 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 16:05:13,245 INFO L350 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 23 treesize of output 26 [2022-12-14 16:05:13,266 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 16:05:13,266 INFO L350 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 18 treesize of output 24 [2022-12-14 16:05:13,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:05:13,502 INFO L350 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 53 treesize of output 45 [2022-12-14 16:05:13,507 INFO L350 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 41 treesize of output 33 [2022-12-14 16:05:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 35 proven. 455 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 16:05:13,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:05:14,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:05:14,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 52 treesize of output 50 [2022-12-14 16:05:15,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 32 [2022-12-14 16:05:15,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 43 treesize of output 32 [2022-12-14 16:05:17,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:05:17,090 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-12-14 16:05:17,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:05:17,100 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-12-14 16:05:17,108 INFO L350 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 44 treesize of output 28 [2022-12-14 16:05:17,116 INFO L350 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 44 treesize of output 28 [2022-12-14 16:05:17,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2022-12-14 16:05:17,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:05:17,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 39 [2022-12-14 16:05:17,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:05:17,164 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2022-12-14 16:05:17,167 INFO L350 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 75 treesize of output 51 [2022-12-14 16:05:17,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 16:05:17,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 47 treesize of output 27 [2022-12-14 16:05:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 14 proven. 446 refuted. 36 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 16:05:17,297 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 16:05:17,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513962972] [2022-12-14 16:05:17,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513962972] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:05:17,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1032831962] [2022-12-14 16:05:17,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 16:05:17,298 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 16:05:17,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 16:05:17,298 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 16:05:17,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (86)] Waiting until timeout for monitored process [2022-12-14 16:05:17,606 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 16:05:17,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140796772] [2022-12-14 16:05:17,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 16:05:17,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:05:17,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:05:17,607 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:05:17,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-12-14 16:05:17,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e38443-adf8-4c1e-92c1-bc778dec3091/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (86)] Ended with exit code 1 [2022-12-14 16:05:17,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 16:05:17,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 16:05:17,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 16:05:17,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:05:17,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2022-12-14 16:05:18,134 INFO L350 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 13 treesize of output 9 [2022-12-14 16:05:18,143 INFO L350 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 13 treesize of output 9 [2022-12-14 16:05:18,490 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 16:05:18,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 13 [2022-12-14 16:05:18,574 INFO L350 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 16 treesize of output 18 [2022-12-14 16:05:18,581 INFO L350 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 16 treesize of output 18 [2022-12-14 16:05:18,590 INFO L350 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 16 treesize of output 18 [2022-12-14 16:05:18,597 INFO L350 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 16 treesize of output 18 [2022-12-14 16:05:18,818 INFO L350 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 14 treesize of output 16 [2022-12-14 16:05:18,824 INFO L350 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 14 treesize of output 16 [2022-12-14 16:05:18,964 INFO L350 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 14 treesize of output 16 [2022-12-14 16:05:18,971 INFO L350 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 14 treesize of output 16 [2022-12-14 16:05:19,073 INFO L350 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 15 treesize of output 7 [2022-12-14 16:05:19,077 INFO L350 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 15 treesize of output 7 [2022-12-14 16:05:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 62 proven. 423 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 16:05:19,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:05:19,576 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_~t4~0.offset))) (and (forall ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| c_~x1~0.base v_ArrVal_2509) c_~t4~0.base) .cse0) (_ bv0 32))) (forall ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| c_~x1~0.base v_ArrVal_2510) c_~t4~0.base) .cse0) (_ bv0 32))))) is different from false [2022-12-14 16:05:48,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:05:48,837 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-12-14 16:05:48,840 INFO L350 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 36 treesize of output 24 [2022-12-14 16:05:48,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-12-14 16:05:48,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:05:48,855 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-12-14 16:05:48,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 16:05:48,858 INFO L350 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 20 treesize of output 8 [2022-12-14 16:05:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 56 proven. 241 refuted. 0 times theorem prover too weak. 38 trivial. 188 not checked. [2022-12-14 16:05:50,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140796772] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:05:50,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 4 imperfect interpolant sequences. [2022-12-14 16:05:50,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 12, 12] total 43 [2022-12-14 16:05:50,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225200528] [2022-12-14 16:05:50,514 INFO L85 oduleStraightlineAll]: Using 4 imperfect interpolants to construct interpolant automaton [2022-12-14 16:05:50,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-14 16:05:50,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 16:05:50,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-14 16:05:50,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1609, Unknown=58, NotChecked=82, Total=1892 [2022-12-14 16:05:50,515 INFO L87 Difference]: Start difference. First operand 38026 states and 43946 transitions. Second operand has 44 states, 44 states have (on average 8.159090909090908) internal successors, (359), 43 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:06:16,155 WARN L233 SmtUtils]: Spent 10.40s on a formula simplification. DAG size of input: 62 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 16:06:19,641 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| c_~S~0.base)) (.cse3 (bvadd c_~S~0.offset (_ bv4 32))) (.cse4 (= c_~S~0.offset (_ bv0 32))) (.cse2 (select |c_#memory_$Pointer$.base| c_~S~0.base)) (.cse1 (= c_~S~0.base c_~x1~0.base))) (and (= c_~S~0.base c_~t4~0.base) (or (= (select .cse0 (_ bv4 32)) (_ bv0 32)) .cse1) (= (_ bv0 1) (bvadd (select |c_#valid| c_~t4~0.base) (_ bv1 1))) (or (= (select .cse2 .cse3) (_ bv0 32)) .cse1) (= c_~x1~0.offset (_ bv0 32)) (or (= (_ bv0 32) (select .cse0 .cse3)) .cse1) (= c_~t4~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |c_#valid| c_~x1~0.base) (_ bv1 1))) .cse4 (or (and (= c_~S~0.base (_ bv0 32)) (exists ((~x1~0.base (_ BitVec 32))) (= (bvadd (select |c_#valid| ~x1~0.base) (_ bv1 1)) (_ bv0 1))) .cse4) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1)))) (or (let ((.cse5 (bvadd (_ bv4 32) c_~x1~0.offset))) (and (forall ((v_ArrVal_2381 (Array (_ BitVec 32) (_ BitVec 32))) (v_~x1~0.base_91 (_ BitVec 32)) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_~x1~0.base_91 (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_91 v_arrayElimArr_7) c_~x1~0.base) .cse5)) (not (= c_~x1~0.base (select v_arrayElimArr_7 (_ bv4 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_91 v_ArrVal_2381) c_~x1~0.base) .cse5) (_ bv0 32)))) (forall ((v_~x1~0.base_91 (_ BitVec 32)) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_91 v_arrayElimArr_7) c_~x1~0.base) .cse5))) (or (= v_~x1~0.base_91 .cse6) (= .cse6 (_ bv0 32)) (not (= c_~x1~0.base (select v_arrayElimArr_7 (_ bv4 32))))))))) (not (= c_~S~0.base c_~t1~0.base)) (not (= c_~S~0.offset c_~t1~0.offset))) (or (= (select .cse2 (_ bv4 32)) (_ bv0 32)) .cse1))) is different from false [2022-12-14 16:06:20,463 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_~x1~0.offset)) (.cse1 (exists ((~x1~0.base (_ BitVec 32))) (= (bvadd (select |c_#valid| ~x1~0.base) (_ bv1 1)) (_ bv0 1)))) (.cse2 (= c_~x4~0.offset (_ bv0 32))) (.cse3 (= c_~x4~0.base (_ bv0 32)))) (and (forall ((v_~x1~0.base_93 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_93))) (forall ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| v_~x1~0.base_93 v_ArrVal_2509) c_~x1~0.base) .cse0) (_ bv0 32))))) (or (and (= c_~t4~0.base (_ bv0 32)) .cse1 (= c_~t4~0.offset (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~t4~0.base) (_ bv1 1)))) .cse2 .cse3 (or (and (= c_~S~0.base (_ bv0 32)) .cse1 (= c_~S~0.offset (_ bv0 32))) (= (_ bv0 1) (bvadd (select |c_#valid| c_~S~0.base) (_ bv1 1)))) (forall ((v_~x1~0.base_93 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_~x1~0.base_93))) (forall ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| v_~x1~0.base_93 v_ArrVal_2510) c_~x1~0.base) .cse0) (_ bv0 32))))) (or (= (bvadd (select |c_#valid| c_~x4~0.base) (_ bv1 1)) (_ bv0 1)) (and .cse1 .cse2 .cse3)))) is different from false [2022-12-14 16:06:23,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:06:25,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 16:06:27,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 16:06:29,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 16:06:31,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:06:33,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 16:06:35,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 16:06:37,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:06:39,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 16:06:41,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 16:06:43,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:06:45,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 16:06:47,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 16:06:49,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 16:06:51,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:06:53,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 16:06:55,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1]