./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-queue-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 --- 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-38b53e6 [2022-11-25 16:53:42,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:53:42,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:53:42,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:53:42,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:53:42,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:53:42,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:53:42,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:53:42,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:53:42,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:53:42,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:53:42,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:53:42,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:53:42,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:53:42,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:53:42,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:53:42,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:53:42,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:53:42,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:53:42,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:53:42,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:53:42,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:53:42,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:53:42,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:53:42,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:53:42,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:53:42,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:53:42,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:53:42,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:53:42,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:53:42,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:53:42,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:53:42,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:53:42,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:53:42,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:53:42,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:53:42,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:53:42,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:53:42,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:53:42,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:53:42,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:53:42,441 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 16:53:42,491 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:53:42,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:53:42,493 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:53:42,493 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:53:42,496 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:53:42,496 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:53:42,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:53:42,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:53:42,498 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:53:42,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:53:42,500 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:53:42,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:53:42,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:53:42,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:53:42,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:53:42,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:53:42,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:53:42,502 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:53:42,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:53:42,502 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:53:42,503 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:53:42,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:53:42,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:53:42,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:53:42,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:53:42,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:53:42,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:53:42,505 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:53:42,506 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:53:42,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:53:42,506 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:53:42,507 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:53:42,507 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:53:42,508 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:53:42,508 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/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_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 [2022-11-25 16:53:42,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:53:42,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:53:42,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:53:42,993 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:53:42,994 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:53:42,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/forester-heap/dll-queue-1.i [2022-11-25 16:53:46,845 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:53:47,334 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:53:47,343 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i [2022-11-25 16:53:47,364 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/data/e09711c4f/67ec79b377d64ce18d51f5c714556dda/FLAGa6bd5a553 [2022-11-25 16:53:47,383 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/data/e09711c4f/67ec79b377d64ce18d51f5c714556dda [2022-11-25 16:53:47,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:53:47,389 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:53:47,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:53:47,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:53:47,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:53:47,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:53:47" (1/1) ... [2022-11-25 16:53:47,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15cefa6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:47, skipping insertion in model container [2022-11-25 16:53:47,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:53:47" (1/1) ... [2022-11-25 16:53:47,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:53:47,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:53:47,872 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[22460,22473] [2022-11-25 16:53:47,879 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[22531,22544] [2022-11-25 16:53:47,881 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[22605,22618] [2022-11-25 16:53:47,882 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[22697,22710] [2022-11-25 16:53:47,883 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[22774,22787] [2022-11-25 16:53:47,885 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[22869,22882] [2022-11-25 16:53:47,886 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[22946,22959] [2022-11-25 16:53:47,888 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[23029,23042] [2022-11-25 16:53:47,889 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[23124,23137] [2022-11-25 16:53:47,891 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[23201,23214] [2022-11-25 16:53:47,892 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[23284,23297] [2022-11-25 16:53:47,894 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[23373,23386] [2022-11-25 16:53:47,896 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[23459,23472] [2022-11-25 16:53:47,899 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[23604,23617] [2022-11-25 16:53:47,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:53:47,916 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:53:47,964 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[22460,22473] [2022-11-25 16:53:47,965 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[22531,22544] [2022-11-25 16:53:47,966 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[22605,22618] [2022-11-25 16:53:47,967 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[22697,22710] [2022-11-25 16:53:47,969 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[22774,22787] [2022-11-25 16:53:47,970 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[22869,22882] [2022-11-25 16:53:47,971 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[22946,22959] [2022-11-25 16:53:47,972 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[23029,23042] [2022-11-25 16:53:47,973 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[23124,23137] [2022-11-25 16:53:47,974 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[23201,23214] [2022-11-25 16:53:47,976 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[23284,23297] [2022-11-25 16:53:47,978 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[23373,23386] [2022-11-25 16:53:47,979 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[23459,23472] [2022-11-25 16:53:47,981 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/sv-benchmarks/c/forester-heap/dll-queue-1.i[23604,23617] [2022-11-25 16:53:47,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:53:48,015 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:53:48,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:48 WrapperNode [2022-11-25 16:53:48,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:53:48,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:53:48,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:53:48,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:53:48,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:48" (1/1) ... [2022-11-25 16:53:48,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:48" (1/1) ... [2022-11-25 16:53:48,081 INFO L138 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 223 [2022-11-25 16:53:48,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:53:48,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:53:48,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:53:48,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:53:48,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:48" (1/1) ... [2022-11-25 16:53:48,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:48" (1/1) ... [2022-11-25 16:53:48,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:48" (1/1) ... [2022-11-25 16:53:48,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:48" (1/1) ... [2022-11-25 16:53:48,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:48" (1/1) ... [2022-11-25 16:53:48,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:48" (1/1) ... [2022-11-25 16:53:48,124 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:48" (1/1) ... [2022-11-25 16:53:48,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:48" (1/1) ... [2022-11-25 16:53:48,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:53:48,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:53:48,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:53:48,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:53:48,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:48" (1/1) ... [2022-11-25 16:53:48,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:53:48,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:53:48,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:53:48,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:53:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 16:53:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:53:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 16:53:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:53:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 16:53:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 16:53:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:53:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:53:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:53:48,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:53:48,406 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:53:48,412 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:53:48,976 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:53:48,986 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:53:48,986 INFO L300 CfgBuilder]: Removed 31 assume(true) statements. [2022-11-25 16:53:48,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:53:48 BoogieIcfgContainer [2022-11-25 16:53:48,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:53:48,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:53:48,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:53:48,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:53:48,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:53:47" (1/3) ... [2022-11-25 16:53:48,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cdd466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:53:48, skipping insertion in model container [2022-11-25 16:53:48,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:53:48" (2/3) ... [2022-11-25 16:53:49,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cdd466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:53:48, skipping insertion in model container [2022-11-25 16:53:49,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:53:48" (3/3) ... [2022-11-25 16:53:49,002 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i [2022-11-25 16:53:49,029 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:53:49,029 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-25 16:53:49,114 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:53:49,128 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@582eb750, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:53:49,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-25 16:53:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 70 states have (on average 2.0) internal successors, (140), 84 states have internal predecessors, (140), 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-11-25 16:53:49,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 16:53:49,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:49,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 16:53:49,151 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-25 16:53:49,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:49,160 INFO L85 PathProgramCache]: Analyzing trace with hash 28752478, now seen corresponding path program 1 times [2022-11-25 16:53:49,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:49,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677556132] [2022-11-25 16:53:49,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:49,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:49,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:49,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677556132] [2022-11-25 16:53:49,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677556132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:49,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:49,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:53:49,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937642501] [2022-11-25 16:53:49,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:49,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 16:53:49,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:49,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:53:49,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:53:49,507 INFO L87 Difference]: Start difference. First operand has 85 states, 70 states have (on average 2.0) internal successors, (140), 84 states have internal predecessors, (140), 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.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-11-25 16:53:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:49,544 INFO L93 Difference]: Finished difference Result 168 states and 278 transitions. [2022-11-25 16:53:49,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:53:49,547 INFO L78 Accepts]: Start accepts. Automaton has has 2 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-11-25 16:53:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:49,561 INFO L225 Difference]: With dead ends: 168 [2022-11-25 16:53:49,561 INFO L226 Difference]: Without dead ends: 80 [2022-11-25 16:53:49,566 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-11-25 16:53:49,577 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:49,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:53:49,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-25 16:53:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-25 16:53:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 79 states have internal predecessors, (89), 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-11-25 16:53:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-11-25 16:53:49,637 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2022-11-25 16:53:49,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:49,638 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-11-25 16:53:49,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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-11-25 16:53:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-11-25 16:53:49,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 16:53:49,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:49,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 16:53:49,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:53:49,640 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-25 16:53:49,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:49,642 INFO L85 PathProgramCache]: Analyzing trace with hash 889571111, now seen corresponding path program 1 times [2022-11-25 16:53:49,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:49,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458318631] [2022-11-25 16:53:49,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:49,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:49,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:49,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458318631] [2022-11-25 16:53:49,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458318631] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:49,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:49,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:53:49,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495016347] [2022-11-25 16:53:49,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:49,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:53:49,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:49,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:53:49,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:53:49,752 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 3 states, 3 states have (on average 2.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-11-25 16:53:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:49,807 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-11-25 16:53:49,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:53:49,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.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-11-25 16:53:49,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:49,809 INFO L225 Difference]: With dead ends: 80 [2022-11-25 16:53:49,810 INFO L226 Difference]: Without dead ends: 70 [2022-11-25 16:53:49,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:53:49,812 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 75 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:49,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 67 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:53:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-25 16:53:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-25 16:53:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 69 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-11-25 16:53:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-11-25 16:53:49,827 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 6 [2022-11-25 16:53:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:49,827 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-11-25 16:53:49,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.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-11-25 16:53:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-11-25 16:53:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 16:53:49,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:49,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:49,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:53:49,830 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-25 16:53:49,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:49,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1270244236, now seen corresponding path program 1 times [2022-11-25 16:53:49,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:49,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697547490] [2022-11-25 16:53:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:49,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:50,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:50,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697547490] [2022-11-25 16:53:50,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697547490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:50,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:50,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:53:50,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604708171] [2022-11-25 16:53:50,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:50,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:53:50,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:50,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:53:50,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:53:50,595 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-11-25 16:53:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:50,831 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2022-11-25 16:53:50,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:53:50,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-11-25 16:53:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:50,833 INFO L225 Difference]: With dead ends: 119 [2022-11-25 16:53:50,834 INFO L226 Difference]: Without dead ends: 117 [2022-11-25 16:53:50,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-25 16:53:50,836 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 159 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:50,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 124 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:53:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-25 16:53:50,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 68. [2022-11-25 16:53:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 67 states have internal predecessors, (77), 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-11-25 16:53:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-11-25 16:53:50,852 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 9 [2022-11-25 16:53:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:50,853 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-11-25 16:53:50,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-11-25 16:53:50,853 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-11-25 16:53:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 16:53:50,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:50,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:50,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:53:50,855 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-25 16:53:50,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:50,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1286414876, now seen corresponding path program 1 times [2022-11-25 16:53:50,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:50,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809169564] [2022-11-25 16:53:50,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:50,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:50,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:50,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809169564] [2022-11-25 16:53:50,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809169564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:50,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:50,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:53:50,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704818764] [2022-11-25 16:53:50,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:50,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:53:50,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:50,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:53:50,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:53:50,911 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-25 16:53:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:50,967 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2022-11-25 16:53:50,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:53:50,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-25 16:53:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:50,970 INFO L225 Difference]: With dead ends: 153 [2022-11-25 16:53:50,970 INFO L226 Difference]: Without dead ends: 87 [2022-11-25 16:53:50,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:53:50,973 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 17 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:50,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 135 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:53:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-25 16:53:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2022-11-25 16:53:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 75 states have internal predecessors, (86), 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-11-25 16:53:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-11-25 16:53:51,009 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 12 [2022-11-25 16:53:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:51,010 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-11-25 16:53:51,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-25 16:53:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-11-25 16:53:51,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 16:53:51,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:51,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:51,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:53:51,014 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-25 16:53:51,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:51,015 INFO L85 PathProgramCache]: Analyzing trace with hash -138012862, now seen corresponding path program 1 times [2022-11-25 16:53:51,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:51,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178730760] [2022-11-25 16:53:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:51,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:51,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:51,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178730760] [2022-11-25 16:53:51,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178730760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:51,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:51,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:53:51,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153918914] [2022-11-25 16:53:51,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:51,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:53:51,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:51,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:53:51,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:53:51,301 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-11-25 16:53:51,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:51,496 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-11-25 16:53:51,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:53:51,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-11-25 16:53:51,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:51,498 INFO L225 Difference]: With dead ends: 91 [2022-11-25 16:53:51,500 INFO L226 Difference]: Without dead ends: 71 [2022-11-25 16:53:51,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:53:51,502 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:51,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 265 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:53:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-25 16:53:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-25 16:53:51,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.253968253968254) internal successors, (79), 70 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-11-25 16:53:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2022-11-25 16:53:51,529 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 17 [2022-11-25 16:53:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:51,530 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2022-11-25 16:53:51,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-11-25 16:53:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-11-25 16:53:51,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 16:53:51,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:51,532 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:51,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:53:51,533 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-25 16:53:51,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:51,535 INFO L85 PathProgramCache]: Analyzing trace with hash -472870040, now seen corresponding path program 1 times [2022-11-25 16:53:51,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:51,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224257091] [2022-11-25 16:53:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:51,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:52,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:52,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224257091] [2022-11-25 16:53:52,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224257091] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:53:52,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388647552] [2022-11-25 16:53:52,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:52,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:53:52,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:53:52,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:53:52,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 16:53:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:52,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 16:53:52,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:53:52,782 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-11-25 16:53:52,910 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-25 16:53:52,956 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-11-25 16:53:52,957 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 53 [2022-11-25 16:53:52,979 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 16:53:52,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-25 16:53:53,058 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:53:53,059 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-25 16:53:53,249 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 24 treesize of output 12 [2022-11-25 16:53:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:53,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:53:53,319 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_285 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-25 16:53:53,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:53:53,368 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2022-11-25 16:53:53,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:53:53,400 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 334 treesize of output 225 [2022-11-25 16:53:53,416 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 204 treesize of output 192 [2022-11-25 16:53:53,435 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 192 treesize of output 184 [2022-11-25 16:53:53,452 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 184 treesize of output 180 [2022-11-25 16:53:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:53,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388647552] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:53:53,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:53:53,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-11-25 16:53:53,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303064025] [2022-11-25 16:53:53,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:53:53,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 16:53:53,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:53,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 16:53:53,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2022-11-25 16:53:53,739 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 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-11-25 16:53:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:54,040 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2022-11-25 16:53:54,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:53:54,041 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 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 19 [2022-11-25 16:53:54,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:54,046 INFO L225 Difference]: With dead ends: 144 [2022-11-25 16:53:54,047 INFO L226 Difference]: Without dead ends: 142 [2022-11-25 16:53:54,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=79, Unknown=1, NotChecked=18, Total=132 [2022-11-25 16:53:54,051 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 191 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:54,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 346 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 71 Unchecked, 0.2s Time] [2022-11-25 16:53:54,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-25 16:53:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 84. [2022-11-25 16:53:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.236842105263158) internal successors, (94), 83 states have internal predecessors, (94), 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-11-25 16:53:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-11-25 16:53:54,083 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 19 [2022-11-25 16:53:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:54,083 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-11-25 16:53:54,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 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-11-25 16:53:54,084 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-11-25 16:53:54,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 16:53:54,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:54,085 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:54,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 16:53:54,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:53:54,299 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-25 16:53:54,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:54,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1456359625, now seen corresponding path program 1 times [2022-11-25 16:53:54,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:54,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246961262] [2022-11-25 16:53:54,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:54,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:54,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:54,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246961262] [2022-11-25 16:53:54,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246961262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:54,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:54,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:53:54,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791224990] [2022-11-25 16:53:54,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:54,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:53:54,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:54,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:53:54,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:53:54,391 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-11-25 16:53:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:54,441 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2022-11-25 16:53:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:53:54,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 20 [2022-11-25 16:53:54,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:54,445 INFO L225 Difference]: With dead ends: 174 [2022-11-25 16:53:54,445 INFO L226 Difference]: Without dead ends: 108 [2022-11-25 16:53:54,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:53:54,448 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 24 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:54,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 127 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:53:54,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-25 16:53:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2022-11-25 16:53:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 89 states have (on average 1.202247191011236) internal successors, (107), 96 states have internal predecessors, (107), 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-11-25 16:53:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-11-25 16:53:54,475 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 20 [2022-11-25 16:53:54,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:54,485 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-11-25 16:53:54,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-11-25 16:53:54,485 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-11-25 16:53:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 16:53:54,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:54,490 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:54,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:53:54,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-25 16:53:54,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:54,491 INFO L85 PathProgramCache]: Analyzing trace with hash 886899864, now seen corresponding path program 1 times [2022-11-25 16:53:54,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:54,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234869138] [2022-11-25 16:53:54,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:54,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 16:53:54,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:54,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234869138] [2022-11-25 16:53:54,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234869138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:53:54,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:53:54,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:53:54,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038329683] [2022-11-25 16:53:54,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:53:54,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:53:54,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:53:54,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:53:54,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:53:54,600 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-11-25 16:53:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:53:54,660 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2022-11-25 16:53:54,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:53:54,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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 27 [2022-11-25 16:53:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:53:54,663 INFO L225 Difference]: With dead ends: 201 [2022-11-25 16:53:54,663 INFO L226 Difference]: Without dead ends: 122 [2022-11-25 16:53:54,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:53:54,668 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 30 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:53:54,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 142 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:53:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-25 16:53:54,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2022-11-25 16:53:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 109 states have internal predecessors, (121), 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-11-25 16:53:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-11-25 16:53:54,688 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 27 [2022-11-25 16:53:54,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:53:54,688 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-11-25 16:53:54,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-11-25 16:53:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-11-25 16:53:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 16:53:54,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:53:54,691 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:53:54,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:53:54,691 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-25 16:53:54,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:53:54,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2041801735, now seen corresponding path program 1 times [2022-11-25 16:53:54,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:53:54,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140354029] [2022-11-25 16:53:54,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:54,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:53:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:56,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:53:56,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140354029] [2022-11-25 16:53:56,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140354029] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:53:56,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789088452] [2022-11-25 16:53:56,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:53:56,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:53:56,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:53:56,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:53:56,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 16:53:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:53:56,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 16:53:56,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:53:56,876 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-11-25 16:53:56,955 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-25 16:53:56,986 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-11-25 16:53:56,992 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 61 [2022-11-25 16:53:57,005 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 5 treesize of output 3 [2022-11-25 16:53:57,038 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-11-25 16:53:57,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-11-25 16:53:57,111 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:53:57,112 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 39 treesize of output 35 [2022-11-25 16:53:57,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:53:57,307 INFO L321 Elim1Store]: treesize reduction 109, result has 9.2 percent of original size [2022-11-25 16:53:57,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 82 [2022-11-25 16:53:57,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:53:57,352 INFO L321 Elim1Store]: treesize reduction 100, result has 4.8 percent of original size [2022-11-25 16:53:57,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 98 treesize of output 60 [2022-11-25 16:53:57,364 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 26 treesize of output 24 [2022-11-25 16:53:57,389 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-25 16:53:57,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 16:53:57,474 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 31 treesize of output 29 [2022-11-25 16:53:57,650 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 24 treesize of output 12 [2022-11-25 16:53:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:53:57,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:53:57,768 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_746 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_744 Int)) (or (not (= (select |c_#valid| v_ArrVal_744) 0)) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_743) v_ArrVal_744 v_ArrVal_746) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_744)) v_ArrVal_744 v_ArrVal_745) |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_747) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))) is different from false [2022-11-25 16:53:57,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:53:57,873 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 30 treesize of output 34 [2022-11-25 16:53:57,888 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_746 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (v_ArrVal_747 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_5 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_743) .cse0 v_ArrVal_746) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_5) .cse0 v_ArrVal_745) |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_747) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2022-11-25 16:53:57,920 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:53:57,921 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 67 [2022-11-25 16:53:57,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:53:57,963 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 41563 treesize of output 32378 [2022-11-25 16:53:58,450 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 32346 treesize of output 30666 [2022-11-25 16:53:58,925 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 30678 treesize of output 25960 [2022-11-25 16:53:59,251 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 25950 treesize of output 24414 [2022-11-25 16:53:59,584 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 24414 treesize of output 24350 [2022-11-25 16:53:59,897 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 24350 treesize of output 23838 [2022-11-25 16:54:00,210 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 23838 treesize of output 23710 [2022-11-25 16:54:00,568 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 23710 treesize of output 23454 [2022-11-25 16:54:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-25 16:54:02,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789088452] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:54:02,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:54:02,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 18 [2022-11-25 16:54:02,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900157918] [2022-11-25 16:54:02,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:54:02,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 16:54:02,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:02,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 16:54:02,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=8, NotChecked=58, Total=306 [2022-11-25 16:54:02,974 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 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-11-25 16:54:03,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:03,613 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2022-11-25 16:54:03,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:54:03,614 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 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 28 [2022-11-25 16:54:03,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:03,615 INFO L225 Difference]: With dead ends: 170 [2022-11-25 16:54:03,615 INFO L226 Difference]: Without dead ends: 168 [2022-11-25 16:54:03,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=8, NotChecked=78, Total=506 [2022-11-25 16:54:03,616 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 213 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:03,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 549 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 264 Invalid, 0 Unknown, 172 Unchecked, 0.3s Time] [2022-11-25 16:54:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-25 16:54:03,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2022-11-25 16:54:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 125 states have internal predecessors, (138), 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-11-25 16:54:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2022-11-25 16:54:03,639 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 28 [2022-11-25 16:54:03,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:03,641 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2022-11-25 16:54:03,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 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-11-25 16:54:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-11-25 16:54:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 16:54:03,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:03,645 INFO L195 NwaCegarLoop]: trace histogram [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-11-25 16:54:03,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 16:54:03,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:03,852 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-25 16:54:03,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:03,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1259768676, now seen corresponding path program 1 times [2022-11-25 16:54:03,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:03,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254902032] [2022-11-25 16:54:03,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:03,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:54:03,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:03,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254902032] [2022-11-25 16:54:03,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254902032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:54:03,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:54:03,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:54:03,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375852152] [2022-11-25 16:54:03,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:54:03,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:54:03,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:03,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:54:03,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:54:03,898 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-11-25 16:54:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:03,920 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2022-11-25 16:54:03,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:54:03,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 29 [2022-11-25 16:54:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:03,922 INFO L225 Difference]: With dead ends: 129 [2022-11-25 16:54:03,922 INFO L226 Difference]: Without dead ends: 127 [2022-11-25 16:54:03,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:54:03,923 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:03,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:54:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-25 16:54:03,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-25 16:54:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 119 states have (on average 1.1680672268907564) internal successors, (139), 126 states have internal predecessors, (139), 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-11-25 16:54:03,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2022-11-25 16:54:03,937 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 29 [2022-11-25 16:54:03,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:03,938 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2022-11-25 16:54:03,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-11-25 16:54:03,938 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2022-11-25 16:54:03,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 16:54:03,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:03,939 INFO L195 NwaCegarLoop]: trace histogram [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-11-25 16:54:03,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:54:03,939 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-25 16:54:03,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:03,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1259766754, now seen corresponding path program 1 times [2022-11-25 16:54:03,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:03,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473008883] [2022-11-25 16:54:03,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:03,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:05,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:05,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473008883] [2022-11-25 16:54:05,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473008883] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:54:05,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753590249] [2022-11-25 16:54:05,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:05,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:05,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:54:05,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:54:05,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 16:54:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:05,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-25 16:54:05,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:54:05,328 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-11-25 16:54:05,370 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 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-25 16:54:05,378 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 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-25 16:54:05,404 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-11-25 16:54:05,404 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 70 [2022-11-25 16:54:05,415 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 5 treesize of output 3 [2022-11-25 16:54:05,427 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 16:54:05,428 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 15 treesize of output 15 [2022-11-25 16:54:05,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:05,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:05,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:54:05,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2022-11-25 16:54:05,487 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:54:05,488 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2022-11-25 16:54:05,493 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 18 treesize of output 20 [2022-11-25 16:54:05,503 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 19 treesize of output 11 [2022-11-25 16:54:05,782 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 27 treesize of output 15 [2022-11-25 16:54:05,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-25 16:54:05,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 15 treesize of output 7 [2022-11-25 16:54:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:05,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:54:05,957 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 72 treesize of output 52 [2022-11-25 16:54:05,969 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_977 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_977) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_ArrVal_979 (Array Int Int))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-11-25 16:54:05,993 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:05,993 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 103 treesize of output 96 [2022-11-25 16:54:06,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:06,003 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 87 treesize of output 64 [2022-11-25 16:54:06,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:06,019 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 217 treesize of output 160 [2022-11-25 16:54:06,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:06,045 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 332 treesize of output 299 [2022-11-25 16:54:06,090 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 283 treesize of output 271 [2022-11-25 16:54:06,102 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 271 treesize of output 267 [2022-11-25 16:54:06,114 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 267 treesize of output 265 [2022-11-25 16:54:06,126 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 265 treesize of output 233 [2022-11-25 16:54:06,138 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 233 treesize of output 221 [2022-11-25 16:54:06,149 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 221 treesize of output 215 [2022-11-25 16:54:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:06,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753590249] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:54:06,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:54:06,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-11-25 16:54:06,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36596628] [2022-11-25 16:54:06,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:54:06,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 16:54:06,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:54:06,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 16:54:06,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=152, Unknown=1, NotChecked=24, Total=210 [2022-11-25 16:54:06,346 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 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-11-25 16:54:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:54:07,174 INFO L93 Difference]: Finished difference Result 218 states and 236 transitions. [2022-11-25 16:54:07,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 16:54:07,175 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 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 29 [2022-11-25 16:54:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:54:07,176 INFO L225 Difference]: With dead ends: 218 [2022-11-25 16:54:07,176 INFO L226 Difference]: Without dead ends: 216 [2022-11-25 16:54:07,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=323, Unknown=1, NotChecked=38, Total=462 [2022-11-25 16:54:07,177 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 283 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:54:07,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 632 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 237 Invalid, 0 Unknown, 87 Unchecked, 0.3s Time] [2022-11-25 16:54:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-25 16:54:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 136. [2022-11-25 16:54:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 128 states have (on average 1.1640625) internal successors, (149), 135 states have internal predecessors, (149), 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-11-25 16:54:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2022-11-25 16:54:07,199 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 29 [2022-11-25 16:54:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:54:07,200 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2022-11-25 16:54:07,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 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-11-25 16:54:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2022-11-25 16:54:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 16:54:07,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:54:07,201 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:54:07,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 16:54:07,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:07,407 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-25 16:54:07,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:54:07,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1992708989, now seen corresponding path program 1 times [2022-11-25 16:54:07,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:54:07,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145573646] [2022-11-25 16:54:07,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:07,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:54:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:09,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:54:09,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145573646] [2022-11-25 16:54:09,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145573646] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:54:09,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133945609] [2022-11-25 16:54:09,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:54:09,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:54:09,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:54:09,136 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:54:09,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2112fc-22c2-4cb6-a0ec-792b2575e206/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 16:54:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:54:09,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-25 16:54:09,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:54:09,358 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-11-25 16:54:09,416 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 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-25 16:54:09,427 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 0 case distinctions, treesize of input 44 treesize of output 35 [2022-11-25 16:54:09,451 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-11-25 16:54:09,452 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 78 [2022-11-25 16:54:09,489 INFO L321 Elim1Store]: treesize reduction 45, result has 43.0 percent of original size [2022-11-25 16:54:09,489 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 2 case distinctions, treesize of input 51 treesize of output 72 [2022-11-25 16:54:09,499 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 28 treesize of output 26 [2022-11-25 16:54:09,527 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 5 treesize of output 3 [2022-11-25 16:54:09,533 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 19 treesize of output 15 [2022-11-25 16:54:09,552 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 5 treesize of output 3 [2022-11-25 16:54:09,579 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-11-25 16:54:09,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-11-25 16:54:09,668 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 16:54:09,668 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 31 treesize of output 29 [2022-11-25 16:54:09,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:54:09,684 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 21 treesize of output 21 [2022-11-25 16:54:09,839 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 16:54:09,839 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 75 [2022-11-25 16:54:09,890 INFO L321 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-11-25 16:54:09,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 179 treesize of output 139 [2022-11-25 16:54:09,904 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 117 [2022-11-25 16:54:09,978 INFO L321 Elim1Store]: treesize reduction 107, result has 12.3 percent of original size [2022-11-25 16:54:09,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 132 [2022-11-25 16:54:09,997 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 9 treesize of output 3 [2022-11-25 16:54:10,027 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2022-11-25 16:54:10,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 46 [2022-11-25 16:54:10,160 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-25 16:54:10,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 87 [2022-11-25 16:54:10,195 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-25 16:54:10,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 91 [2022-11-25 16:54:10,553 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:54:10,553 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 34 [2022-11-25 16:54:10,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-11-25 16:54:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:54:10,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:54:10,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:10,871 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 91 treesize of output 95 [2022-11-25 16:54:10,881 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:10,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 80 [2022-11-25 16:54:10,906 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_1259 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1251 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_16 |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (= .cse0 0) (not (= (select v_arrayElimArr_15 |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (not (= (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_16))) (let ((.cse3 (select (select (store .cse2 .cse0 v_ArrVal_1259) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (select (let ((.cse1 (store (store .cse2 .cse0 v_ArrVal_1251) .cse3 v_ArrVal_1265))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_15) .cse0 v_ArrVal_1252) .cse3 v_ArrVal_1264) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) 0)) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2022-11-25 16:54:10,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:10,941 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 489 treesize of output 393 [2022-11-25 16:54:10,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:10,955 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 341 treesize of output 238 [2022-11-25 16:54:14,918 INFO L321 Elim1Store]: treesize reduction 1186, result has 37.6 percent of original size [2022-11-25 16:54:14,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 23 new quantified variables, introduced 153 case distinctions, treesize of input 3330796 treesize of output 2404352 [2022-11-25 16:54:21,710 WARN L233 SmtUtils]: Spent 6.78s on a formula simplification that was a NOOP. DAG size: 1747 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:54:28,538 WARN L233 SmtUtils]: Spent 6.80s on a formula simplification that was a NOOP. DAG size: 1732 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:54:29,119 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:54:29,127 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 7934034 treesize of output 7042317 [2022-11-25 16:56:30,197 WARN L233 SmtUtils]: Spent 2.02m on a formula simplification. DAG size of input: 4211 DAG size of output: 4168 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:57:02,517 WARN L233 SmtUtils]: Spent 32.26s on a formula simplification that was a NOOP. DAG size: 4165 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:57:02,830 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 6897846 treesize of output 6343470 [2022-11-25 16:57:34,845 WARN L233 SmtUtils]: Spent 32.01s on a formula simplification that was a NOOP. DAG size: 4164 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:57:35,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:57:35,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 6343526 treesize of output 5810310 [2022-11-25 16:58:09,528 WARN L233 SmtUtils]: Spent 33.71s on a formula simplification that was a NOOP. DAG size: 4255 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:58:09,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:58:10,006 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 5804634 treesize of output 5307782 [2022-11-25 16:58:41,142 WARN L233 SmtUtils]: Spent 31.13s on a formula simplification that was a NOOP. DAG size: 4257 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:58:41,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:58:42,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4694077 treesize of output 4544679 [2022-11-25 16:59:16,149 WARN L233 SmtUtils]: Spent 34.14s on a formula simplification that was a NOOP. DAG size: 4301 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:59:16,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:59:16,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4666113 treesize of output 4365881 [2022-11-25 16:59:52,304 WARN L233 SmtUtils]: Spent 35.33s on a formula simplification that was a NOOP. DAG size: 4345 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 16:59:52,570 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 4829654 treesize of output 4821192 [2022-11-25 17:00:26,737 WARN L233 SmtUtils]: Spent 34.16s on a formula simplification that was a NOOP. DAG size: 4344 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 17:00:27,479 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:27,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4285455 treesize of output 4250511 [2022-11-25 17:01:04,874 WARN L233 SmtUtils]: Spent 37.38s on a formula simplification that was a NOOP. DAG size: 4388 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 17:01:05,191 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 4785956 treesize of output 4697556 [2022-11-25 17:01:43,447 WARN L233 SmtUtils]: Spent 38.25s on a formula simplification that was a NOOP. DAG size: 4387 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 17:01:43,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:01:43,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 634529 treesize of output 610125 [2022-11-25 17:02:18,107 WARN L233 SmtUtils]: Spent 34.28s on a formula simplification that was a NOOP. DAG size: 4395 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 17:02:18,383 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 610119 treesize of output 557899 [2022-11-25 17:02:53,586 WARN L233 SmtUtils]: Spent 35.20s on a formula simplification that was a NOOP. DAG size: 4394 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 17:02:53,815 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 553614 treesize of output 515090 [2022-11-25 17:03:28,768 WARN L233 SmtUtils]: Spent 34.95s on a formula simplification that was a NOOP. DAG size: 4393 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 17:04:19,843 WARN L233 SmtUtils]: Spent 24.87s on a formula simplification that was a NOOP. DAG size: 3123 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 17:06:00,789 WARN L233 SmtUtils]: Spent 20.97s on a formula simplification that was a NOOP. DAG size: 2784 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)