./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-circular-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a --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 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- 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-b5237d8 [2022-11-21 13:51:27,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:51:27,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:51:27,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:51:27,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:51:27,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:51:27,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:51:27,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:51:27,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:51:27,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:51:27,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:51:27,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:51:27,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:51:27,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:51:27,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:51:27,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:51:27,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:51:27,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:51:27,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:51:27,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:51:27,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:51:27,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:51:27,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:51:27,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:51:27,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:51:27,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:51:27,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:51:27,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:51:27,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:51:27,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:51:27,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:51:27,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:51:27,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:51:27,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:51:27,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:51:27,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:51:27,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:51:27,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:51:27,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:51:27,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:51:27,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:51:27,412 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 13:51:27,433 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:51:27,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:51:27,434 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:51:27,434 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:51:27,435 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:51:27,435 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:51:27,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:51:27,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:51:27,436 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:51:27,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:51:27,436 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:51:27,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:51:27,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:51:27,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:51:27,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 13:51:27,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:51:27,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 13:51:27,438 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:51:27,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 13:51:27,438 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:51:27,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 13:51:27,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:51:27,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:51:27,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:51:27,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:51:27,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:51:27,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:51:27,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 13:51:27,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:51:27,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:51:27,440 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 13:51:27,440 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 13:51:27,440 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 13:51:27,440 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/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_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a 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 -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2022-11-21 13:51:27,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:51:27,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:51:27,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:51:27,751 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:51:27,753 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:51:27,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-11-21 13:51:30,989 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:51:31,253 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:51:31,255 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-11-21 13:51:31,269 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/data/08f9cc5db/02b2b49d88d34d36859283c7fb6f5d2d/FLAG7ac7d3370 [2022-11-21 13:51:31,288 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/data/08f9cc5db/02b2b49d88d34d36859283c7fb6f5d2d [2022-11-21 13:51:31,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:51:31,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:51:31,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:51:31,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:51:31,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:51:31,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:51:31" (1/1) ... [2022-11-21 13:51:31,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6c1783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:31, skipping insertion in model container [2022-11-21 13:51:31,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:51:31" (1/1) ... [2022-11-21 13:51:31,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:51:31,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:51:31,629 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_1ab2c284-abcd-4b30-b166-7dd452fc93df/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2022-11-21 13:51:31,635 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_1ab2c284-abcd-4b30-b166-7dd452fc93df/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2022-11-21 13:51:31,637 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_1ab2c284-abcd-4b30-b166-7dd452fc93df/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2022-11-21 13:51:31,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:51:31,651 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:51:31,698 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_1ab2c284-abcd-4b30-b166-7dd452fc93df/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2022-11-21 13:51:31,700 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_1ab2c284-abcd-4b30-b166-7dd452fc93df/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2022-11-21 13:51:31,701 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_1ab2c284-abcd-4b30-b166-7dd452fc93df/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2022-11-21 13:51:31,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:51:31,739 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:51:31,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:31 WrapperNode [2022-11-21 13:51:31,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:51:31,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:51:31,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:51:31,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:51:31,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:31" (1/1) ... [2022-11-21 13:51:31,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:31" (1/1) ... [2022-11-21 13:51:31,812 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 117 [2022-11-21 13:51:31,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:51:31,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:51:31,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:51:31,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:51:31,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:31" (1/1) ... [2022-11-21 13:51:31,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:31" (1/1) ... [2022-11-21 13:51:31,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:31" (1/1) ... [2022-11-21 13:51:31,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:31" (1/1) ... [2022-11-21 13:51:31,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:31" (1/1) ... [2022-11-21 13:51:31,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:31" (1/1) ... [2022-11-21 13:51:31,859 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:31" (1/1) ... [2022-11-21 13:51:31,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:31" (1/1) ... [2022-11-21 13:51:31,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:51:31,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:51:31,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:51:31,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:51:31,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:31" (1/1) ... [2022-11-21 13:51:31,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:51:31,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:51:31,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:51:31,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:51:31,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 13:51:31,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:51:31,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 13:51:31,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:51:31,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 13:51:31,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 13:51:31,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:51:31,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:51:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:51:31,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:51:32,065 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:51:32,067 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:51:32,437 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:51:32,444 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:51:32,449 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-21 13:51:32,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:51:32 BoogieIcfgContainer [2022-11-21 13:51:32,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:51:32,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:51:32,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:51:32,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:51:32,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:51:31" (1/3) ... [2022-11-21 13:51:32,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677881c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:51:32, skipping insertion in model container [2022-11-21 13:51:32,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:31" (2/3) ... [2022-11-21 13:51:32,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677881c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:51:32, skipping insertion in model container [2022-11-21 13:51:32,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:51:32" (3/3) ... [2022-11-21 13:51:32,469 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2022-11-21 13:51:32,486 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:51:32,486 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-21 13:51:32,535 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:51:32,542 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;@4b78266a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:51:32,542 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-21 13:51:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 32 states have internal predecessors, (51), 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-21 13:51:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 13:51:32,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:32,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 13:51:32,556 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:32,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:32,561 INFO L85 PathProgramCache]: Analyzing trace with hash 890892102, now seen corresponding path program 1 times [2022-11-21 13:51:32,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:32,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554572578] [2022-11-21 13:51:32,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:32,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:32,748 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-21 13:51:32,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:32,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554572578] [2022-11-21 13:51:32,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554572578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:32,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:32,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:51:32,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149476204] [2022-11-21 13:51:32,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:32,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 13:51:32,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:32,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 13:51:32,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:51:32,791 INFO L87 Difference]: Start difference. First operand has 33 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 32 states have internal predecessors, (51), 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 3.0) internal successors, (6), 2 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-21 13:51:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:32,810 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-11-21 13:51:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 13:51:32,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-21 13:51:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:32,821 INFO L225 Difference]: With dead ends: 64 [2022-11-21 13:51:32,821 INFO L226 Difference]: Without dead ends: 26 [2022-11-21 13:51:32,824 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-21 13:51:32,828 INFO L413 NwaCegarLoop]: 39 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, 39 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-21 13:51:32,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:51:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-21 13:51:32,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-21 13:51:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 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-21 13:51:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-11-21 13:51:32,863 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 6 [2022-11-21 13:51:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:32,864 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-11-21 13:51:32,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-21 13:51:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-11-21 13:51:32,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-21 13:51:32,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:32,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:32,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:51:32,866 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:32,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1806883023, now seen corresponding path program 1 times [2022-11-21 13:51:32,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:32,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008498263] [2022-11-21 13:51:32,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:32,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:33,414 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-21 13:51:33,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:33,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008498263] [2022-11-21 13:51:33,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008498263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:33,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:33,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:51:33,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895217121] [2022-11-21 13:51:33,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:33,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:51:33,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:33,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:51:33,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:51:33,419 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:33,503 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-11-21 13:51:33,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:51:33,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-21 13:51:33,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:33,504 INFO L225 Difference]: With dead ends: 42 [2022-11-21 13:51:33,505 INFO L226 Difference]: Without dead ends: 38 [2022-11-21 13:51:33,505 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-21 13:51:33,507 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:33,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 47 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-21 13:51:33,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-11-21 13:51:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-11-21 13:51:33,514 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 7 [2022-11-21 13:51:33,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:33,515 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-11-21 13:51:33,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-11-21 13:51:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 13:51:33,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:33,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:33,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:51:33,517 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:33,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:33,518 INFO L85 PathProgramCache]: Analyzing trace with hash 706691337, now seen corresponding path program 1 times [2022-11-21 13:51:33,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:33,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148150373] [2022-11-21 13:51:33,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:33,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:33,598 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-21 13:51:33,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:33,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148150373] [2022-11-21 13:51:33,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148150373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:33,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:33,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:51:33,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131664115] [2022-11-21 13:51:33,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:33,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:51:33,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:33,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:51:33,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:51:33,602 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-21 13:51:33,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:33,643 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-11-21 13:51:33,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:51:33,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-11-21 13:51:33,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:33,647 INFO L225 Difference]: With dead ends: 71 [2022-11-21 13:51:33,648 INFO L226 Difference]: Without dead ends: 49 [2022-11-21 13:51:33,648 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-21 13:51:33,649 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:33,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 48 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:51:33,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-21 13:51:33,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-11-21 13:51:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 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-21 13:51:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-11-21 13:51:33,666 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 10 [2022-11-21 13:51:33,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:33,666 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-11-21 13:51:33,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-21 13:51:33,667 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-11-21 13:51:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 13:51:33,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:33,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:33,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:51:33,669 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:33,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash -84804677, now seen corresponding path program 1 times [2022-11-21 13:51:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:33,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917890098] [2022-11-21 13:51:33,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:33,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:33,711 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-21 13:51:33,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:33,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917890098] [2022-11-21 13:51:33,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917890098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:33,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:33,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:51:33,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741181573] [2022-11-21 13:51:33,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:33,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:51:33,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:33,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:51:33,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:51:33,715 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-21 13:51:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:33,731 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-11-21 13:51:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:51:33,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-11-21 13:51:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:33,732 INFO L225 Difference]: With dead ends: 38 [2022-11-21 13:51:33,733 INFO L226 Difference]: Without dead ends: 36 [2022-11-21 13:51:33,733 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-21 13:51:33,734 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 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-21 13:51:33,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:51:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-21 13:51:33,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-21 13:51:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 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-21 13:51:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-11-21 13:51:33,742 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 13 [2022-11-21 13:51:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:33,743 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-11-21 13:51:33,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-21 13:51:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-11-21 13:51:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 13:51:33,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:33,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:33,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:51:33,745 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:33,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:33,746 INFO L85 PathProgramCache]: Analyzing trace with hash -84802755, now seen corresponding path program 1 times [2022-11-21 13:51:33,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:33,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130257971] [2022-11-21 13:51:33,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:33,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:34,317 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-21 13:51:34,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:34,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130257971] [2022-11-21 13:51:34,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130257971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:34,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:34,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:51:34,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672310551] [2022-11-21 13:51:34,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:34,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:51:34,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:34,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:51:34,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:51:34,323 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-21 13:51:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:34,519 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-11-21 13:51:34,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:51:34,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-11-21 13:51:34,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:34,522 INFO L225 Difference]: With dead ends: 47 [2022-11-21 13:51:34,522 INFO L226 Difference]: Without dead ends: 34 [2022-11-21 13:51:34,524 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-21 13:51:34,528 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:34,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 73 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-21 13:51:34,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-21 13:51:34,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 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-21 13:51:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-11-21 13:51:34,547 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 13 [2022-11-21 13:51:34,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:34,548 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-11-21 13:51:34,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-21 13:51:34,550 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-11-21 13:51:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 13:51:34,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:34,550 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:34,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 13:51:34,551 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:34,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:34,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1783178116, now seen corresponding path program 1 times [2022-11-21 13:51:34,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:34,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049481800] [2022-11-21 13:51:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:34,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:35,264 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-21 13:51:35,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:35,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049481800] [2022-11-21 13:51:35,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049481800] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:35,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394814596] [2022-11-21 13:51:35,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:35,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:35,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:51:35,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:51:35,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:51:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:35,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-21 13:51:35,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:35,489 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-21 13:51:35,584 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-21 13:51:35,612 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-11-21 13:51:35,615 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-21 13:51:35,639 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 13:51:35,639 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-21 13:51:35,693 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:51:35,694 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 30 treesize of output 28 [2022-11-21 13:51:35,756 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 47 treesize of output 27 [2022-11-21 13:51:35,761 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 18 treesize of output 16 [2022-11-21 13:51:35,776 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-21 13:51:35,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:51:35,789 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-21 13:51:35,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:51:35,834 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-21 13:51:35,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:51:35,860 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-21 13:51:35,876 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-21 13:51:35,893 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 188 [2022-11-21 13:51:35,907 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 188 treesize of output 180 [2022-11-21 13:51:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-21 13:51:36,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394814596] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:51:36,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:51:36,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-11-21 13:51:36,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977439917] [2022-11-21 13:51:36,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:51:36,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 13:51:36,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:36,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 13:51:36,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2022-11-21 13:51:36,116 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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-21 13:51:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:36,231 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-11-21 13:51:36,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:51:36,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 13 [2022-11-21 13:51:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:36,233 INFO L225 Difference]: With dead ends: 61 [2022-11-21 13:51:36,233 INFO L226 Difference]: Without dead ends: 59 [2022-11-21 13:51:36,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2022-11-21 13:51:36,234 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 57 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:36,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 84 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2022-11-21 13:51:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-21 13:51:36,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2022-11-21 13:51:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 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-21 13:51:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-11-21 13:51:36,242 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 13 [2022-11-21 13:51:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:36,243 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-11-21 13:51:36,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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-21 13:51:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-11-21 13:51:36,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 13:51:36,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:36,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:36,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 13:51:36,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-21 13:51:36,450 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:36,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:36,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1644077251, now seen corresponding path program 1 times [2022-11-21 13:51:36,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:36,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779643589] [2022-11-21 13:51:36,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:36,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:36,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:36,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779643589] [2022-11-21 13:51:36,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779643589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:36,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:36,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:51:36,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142138931] [2022-11-21 13:51:36,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:36,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:51:36,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:36,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:51:36,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:51:36,516 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 13:51:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:36,538 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-11-21 13:51:36,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:51:36,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 13:51:36,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:36,540 INFO L225 Difference]: With dead ends: 96 [2022-11-21 13:51:36,540 INFO L226 Difference]: Without dead ends: 73 [2022-11-21 13:51:36,540 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-21 13:51:36,541 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:36,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 70 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:51:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-21 13:51:36,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2022-11-21 13:51:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 55 states have internal predecessors, (68), 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-21 13:51:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-11-21 13:51:36,558 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 17 [2022-11-21 13:51:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:36,558 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-11-21 13:51:36,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-21 13:51:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-11-21 13:51:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:51:36,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:36,559 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-21 13:51:36,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 13:51:36,559 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:51:36,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:36,560 INFO L85 PathProgramCache]: Analyzing trace with hash 619754034, now seen corresponding path program 1 times [2022-11-21 13:51:36,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:36,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188777424] [2022-11-21 13:51:36,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:36,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:38,131 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-21 13:51:38,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:38,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188777424] [2022-11-21 13:51:38,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188777424] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:38,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18851529] [2022-11-21 13:51:38,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:38,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:38,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:51:38,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:51:38,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ab2c284-abcd-4b30-b166-7dd452fc93df/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:51:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:38,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-21 13:51:38,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:38,306 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-21 13:51:38,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 13:51:38,440 INFO L321 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2022-11-21 13:51:38,441 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 2 case distinctions, treesize of input 253 treesize of output 190 [2022-11-21 13:51:38,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:38,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:51:38,465 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 39 treesize of output 30 [2022-11-21 13:51:38,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:38,482 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2022-11-21 13:51:38,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:38,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:38,546 INFO L321 Elim1Store]: treesize reduction 136, result has 3.5 percent of original size [2022-11-21 13:51:38,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 186 treesize of output 204 [2022-11-21 13:51:38,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:38,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:38,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:38,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:51:38,572 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 27 treesize of output 24 [2022-11-21 13:51:38,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:38,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:38,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:51:38,598 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 19 treesize of output 18 [2022-11-21 13:51:38,626 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:51:38,626 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 11 treesize of output 11 [2022-11-21 13:51:38,650 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:51:38,665 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:51:38,680 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 8 treesize of output 7 [2022-11-21 13:51:38,695 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:51:38,709 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:51:38,786 INFO L321 Elim1Store]: treesize reduction 70, result has 6.7 percent of original size [2022-11-21 13:51:38,786 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 102 treesize of output 59 [2022-11-21 13:51:38,791 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-21 13:51:38,924 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:51:38,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-21 13:51:38,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 13:51:38,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:38,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:38,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:51:38,951 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:51:38,951 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-11-21 13:51:38,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-11-21 13:51:39,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:39,137 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:51:39,137 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 1 case distinctions, treesize of input 99 treesize of output 76 [2022-11-21 13:51:39,158 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-21 13:51:39,159 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2022-11-21 13:51:39,169 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-21 13:51:39,360 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-21 13:51:39,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 61 [2022-11-21 13:51:39,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:51:39,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2022-11-21 13:51:39,403 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-21 13:51:39,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:51:39,467 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_639 (Array Int Int)) (v_ArrVal_636 Int) (v_ArrVal_635 Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 v_ArrVal_636))) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 v_ArrVal_635)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_639) (select (select .cse0 .cse1) .cse2)) (+ 8 (select (select .cse3 .cse1) .cse2)))))) 0)) is different from false [2022-11-21 13:51:39,785 INFO L321 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-11-21 13:51:39,785 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 4646 treesize of output 3639 [2022-11-21 13:51:40,170 INFO L321 Elim1Store]: treesize reduction 27, result has 64.9 percent of original size [2022-11-21 13:51:40,171 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 4 case distinctions, treesize of input 26520 treesize of output 18457 [2022-11-21 13:51:46,195 WARN L233 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 192 DAG size of output: 144 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-21 13:51:46,197 INFO L321 Elim1Store]: treesize reduction 364, result has 65.0 percent of original size [2022-11-21 13:51:46,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 950378 treesize of output 861254 [2022-11-21 13:52:05,607 WARN L233 SmtUtils]: Spent 14.45s on a formula simplification. DAG size of input: 314 DAG size of output: 290 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-21 13:52:05,610 INFO L321 Elim1Store]: treesize reduction 180, result has 86.1 percent of original size [2022-11-21 13:52:05,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 14 new quantified variables, introduced 66 case distinctions, treesize of input 25549256 treesize of output 23854126 [2022-11-21 13:53:29,049 WARN L233 SmtUtils]: Spent 1.39m on a formula simplification. DAG size of input: 16220 DAG size of output: 16220 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 13:59:58,086 WARN L233 SmtUtils]: Spent 6.48m on a formula simplification. DAG size of input: 15997 DAG size of output: 15744 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 13:59:59,688 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 22644916 treesize of output 21970778 [2022-11-21 14:00:48,125 WARN L233 SmtUtils]: Spent 48.42s on a formula simplification that was a NOOP. DAG size: 15743 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 14:00:50,234 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 21968884 treesize of output 20218676 [2022-11-21 14:01:39,525 WARN L233 SmtUtils]: Spent 49.26s on a formula simplification that was a NOOP. DAG size: 15742 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 14:01:45,332 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:01:45,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 40509550 treesize of output 39737810