./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s2lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s2lif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8 --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 b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 13:04:58,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:04:58,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:04:58,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:04:58,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:04:58,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:04:58,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:04:58,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:04:58,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:04:58,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:04:58,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:04:58,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:04:58,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:04:58,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:04:58,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:04:58,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:04:58,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:04:58,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:04:58,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:04:58,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:04:58,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:04:58,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:04:58,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:04:58,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:04:58,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:04:58,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:04:58,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:04:58,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:04:58,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:04:58,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:04:58,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:04:58,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:04:58,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:04:58,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:04:58,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:04:58,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:04:58,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:04:58,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:04:58,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:04:58,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:04:58,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:04:58,445 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 13:04:58,459 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:04:58,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:04:58,459 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:04:58,459 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:04:58,460 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:04:58,460 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:04:58,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:04:58,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:04:58,471 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:04:58,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:04:58,472 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:04:58,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:04:58,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:04:58,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:04:58,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:04:58,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:04:58,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:04:58,473 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:04:58,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:04:58,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:04:58,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:04:58,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:04:58,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:04:58,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:04:58,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:04:58,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:04:58,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:04:58,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:04:58,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:04:58,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:04:58,476 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:04:58,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:04:58,476 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:04:58,477 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:04:58,477 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:04:58,477 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/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_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8 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 -> b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f [2022-12-13 13:04:58,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:04:58,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:04:58,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:04:58,697 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:04:58,698 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:04:58,699 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/array-fpi/s2lif.c [2022-12-13 13:05:01,252 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:05:01,393 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:05:01,394 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/sv-benchmarks/c/array-fpi/s2lif.c [2022-12-13 13:05:01,400 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/data/9e4e4ee5b/76f28e73b5dc49b692a3634ad82eb909/FLAGf79817dbe [2022-12-13 13:05:01,411 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/data/9e4e4ee5b/76f28e73b5dc49b692a3634ad82eb909 [2022-12-13 13:05:01,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:05:01,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:05:01,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:05:01,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:05:01,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:05:01,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:05:01" (1/1) ... [2022-12-13 13:05:01,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167d6564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:01, skipping insertion in model container [2022-12-13 13:05:01,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:05:01" (1/1) ... [2022-12-13 13:05:01,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:05:01,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:05:01,546 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_09c2e780-7736-43de-b4fd-df37a85b29b6/sv-benchmarks/c/array-fpi/s2lif.c[588,601] [2022-12-13 13:05:01,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:05:01,568 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:05:01,578 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_09c2e780-7736-43de-b4fd-df37a85b29b6/sv-benchmarks/c/array-fpi/s2lif.c[588,601] [2022-12-13 13:05:01,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:05:01,594 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:05:01,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:01 WrapperNode [2022-12-13 13:05:01,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:05:01,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:05:01,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:05:01,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:05:01,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:01" (1/1) ... [2022-12-13 13:05:01,607 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:01" (1/1) ... [2022-12-13 13:05:01,622 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-12-13 13:05:01,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:05:01,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:05:01,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:05:01,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:05:01,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:01" (1/1) ... [2022-12-13 13:05:01,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:01" (1/1) ... [2022-12-13 13:05:01,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:01" (1/1) ... [2022-12-13 13:05:01,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:01" (1/1) ... [2022-12-13 13:05:01,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:01" (1/1) ... [2022-12-13 13:05:01,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:01" (1/1) ... [2022-12-13 13:05:01,639 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:01" (1/1) ... [2022-12-13 13:05:01,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:01" (1/1) ... [2022-12-13 13:05:01,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:05:01,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:05:01,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:05:01,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:05:01,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:01" (1/1) ... [2022-12-13 13:05:01,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:05:01,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:05:01,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:05:01,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:05:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:05:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:05:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:05:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:05:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 13:05:01,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:05:01,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:05:01,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:05:01,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:05:01,750 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:05:01,752 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:05:01,889 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:05:01,894 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:05:01,894 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 13:05:01,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:05:01 BoogieIcfgContainer [2022-12-13 13:05:01,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:05:01,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:05:01,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:05:01,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:05:01,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:05:01" (1/3) ... [2022-12-13 13:05:01,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a31c42e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:05:01, skipping insertion in model container [2022-12-13 13:05:01,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:05:01" (2/3) ... [2022-12-13 13:05:01,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a31c42e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:05:01, skipping insertion in model container [2022-12-13 13:05:01,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:05:01" (3/3) ... [2022-12-13 13:05:01,904 INFO L112 eAbstractionObserver]: Analyzing ICFG s2lif.c [2022-12-13 13:05:01,919 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:05:01,919 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:05:01,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:05:01,959 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;@54db1bcc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:05:01,959 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 13:05:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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-12-13 13:05:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 13:05:01,967 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:05:01,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:01,968 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:05:01,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:01,971 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-12-13 13:05:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:01,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679612246] [2022-12-13 13:05:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:01,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:05:02,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:02,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679612246] [2022-12-13 13:05:02,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679612246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:05:02,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:05:02,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:05:02,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556736793] [2022-12-13 13:05:02,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:05:02,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 13:05:02,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:02,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 13:05:02,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:05:02,151 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-12-13 13:05:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:05:02,163 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-12-13 13:05:02,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 13:05:02,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-12-13 13:05:02,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:05:02,170 INFO L225 Difference]: With dead ends: 40 [2022-12-13 13:05:02,170 INFO L226 Difference]: Without dead ends: 18 [2022-12-13 13:05:02,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:05:02,175 INFO L413 NwaCegarLoop]: 26 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, 26 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-12-13 13:05:02,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:05:02,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-13 13:05:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-13 13:05:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-12-13 13:05:02,198 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-12-13 13:05:02,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:05:02,199 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-12-13 13:05:02,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-12-13 13:05:02,199 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-12-13 13:05:02,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 13:05:02,199 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:05:02,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:02,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:05:02,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:05:02,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:02,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-12-13 13:05:02,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:02,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551373984] [2022-12-13 13:05:02,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:02,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:05:02,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:02,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551373984] [2022-12-13 13:05:02,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551373984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:05:02,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:05:02,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:05:02,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23300122] [2022-12-13 13:05:02,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:05:02,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:05:02,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:02,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:05:02,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:05:02,323 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-12-13 13:05:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:05:02,375 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-12-13 13:05:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:05:02,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-12-13 13:05:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:05:02,376 INFO L225 Difference]: With dead ends: 36 [2022-12-13 13:05:02,377 INFO L226 Difference]: Without dead ends: 25 [2022-12-13 13:05:02,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:05:02,379 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:05:02,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:05:02,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-13 13:05:02,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-12-13 13:05:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-12-13 13:05:02,383 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-12-13 13:05:02,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:05:02,383 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-12-13 13:05:02,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-12-13 13:05:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-12-13 13:05:02,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 13:05:02,384 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:05:02,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:02,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:05:02,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:05:02,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:02,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-12-13 13:05:02,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:02,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935291723] [2022-12-13 13:05:02,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:02,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:05:03,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:03,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935291723] [2022-12-13 13:05:03,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935291723] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:05:03,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96885063] [2022-12-13 13:05:03,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:03,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:03,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:05:03,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:05:03,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:05:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:03,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 13:05:03,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:05:03,323 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 10 treesize of output 8 [2022-12-13 13:05:03,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:05:03,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 13:05:03,520 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 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 13:05:03,620 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 0 case distinctions, treesize of input 36 treesize of output 23 [2022-12-13 13:05:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:05:03,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:05:03,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:05:03,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-12-13 13:05:04,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:05:04,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-13 13:05:04,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:05:04,040 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 22 treesize of output 14 [2022-12-13 13:05:04,045 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 14 treesize of output 10 [2022-12-13 13:05:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:05:04,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96885063] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:05:04,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:05:04,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2022-12-13 13:05:04,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055915509] [2022-12-13 13:05:04,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:05:04,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 13:05:04,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:04,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 13:05:04,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2022-12-13 13:05:04,059 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:05:04,726 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-12-13 13:05:04,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 13:05:04,727 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 13:05:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:05:04,729 INFO L225 Difference]: With dead ends: 53 [2022-12-13 13:05:04,729 INFO L226 Difference]: Without dead ends: 49 [2022-12-13 13:05:04,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2022-12-13 13:05:04,731 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 55 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:05:04,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 83 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 13:05:04,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-13 13:05:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2022-12-13 13:05:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-12-13 13:05:04,740 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-12-13 13:05:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:05:04,740 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-12-13 13:05:04,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-12-13 13:05:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 13:05:04,741 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:05:04,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:04,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:05:04,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:04,943 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:05:04,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:04,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-12-13 13:05:04,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:04,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320070387] [2022-12-13 13:05:04,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:04,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:05,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:05,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320070387] [2022-12-13 13:05:05,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320070387] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:05:05,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253719244] [2022-12-13 13:05:05,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:05,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:05,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:05:05,223 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:05:05,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:05:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:05,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 13:05:05,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:05:05,280 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 18 treesize of output 14 [2022-12-13 13:05:05,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:05:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:05,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:05:05,327 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 14 treesize of output 12 [2022-12-13 13:05:05,329 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-12-13 13:05:05,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:05,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253719244] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:05:05,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:05:05,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 13:05:05,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580182648] [2022-12-13 13:05:05,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:05:05,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:05:05,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:05,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:05:05,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:05:05,340 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:05,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:05:05,409 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-12-13 13:05:05,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:05:05,410 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 13:05:05,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:05:05,410 INFO L225 Difference]: With dead ends: 48 [2022-12-13 13:05:05,410 INFO L226 Difference]: Without dead ends: 37 [2022-12-13 13:05:05,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:05:05,411 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:05:05,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 56 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:05:05,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-12-13 13:05:05,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-12-13 13:05:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-12-13 13:05:05,416 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2022-12-13 13:05:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:05:05,417 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-12-13 13:05:05,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-12-13 13:05:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 13:05:05,417 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:05:05,417 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:05,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 13:05:05,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:05,619 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:05:05,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:05,620 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-12-13 13:05:05,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:05,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569020054] [2022-12-13 13:05:05,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:05,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:05,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:05,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569020054] [2022-12-13 13:05:05,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569020054] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:05:05,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621123564] [2022-12-13 13:05:05,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:05:05,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:05,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:05:05,773 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:05:05,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:05:05,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:05:05,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:05:05,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:05:05,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:05:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:05,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:05:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:05,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621123564] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:05:05,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:05:05,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 13:05:05,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488807999] [2022-12-13 13:05:05,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:05:05,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:05:05,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:05,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:05:05,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:05:05,903 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:05:05,994 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-12-13 13:05:05,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:05:05,995 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 22 [2022-12-13 13:05:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:05:05,995 INFO L225 Difference]: With dead ends: 70 [2022-12-13 13:05:05,995 INFO L226 Difference]: Without dead ends: 44 [2022-12-13 13:05:05,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:05:05,997 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 51 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:05:05,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 30 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:05:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-13 13:05:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-12-13 13:05:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-12-13 13:05:06,003 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-12-13 13:05:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:05:06,003 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-12-13 13:05:06,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-12-13 13:05:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 13:05:06,004 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:05:06,004 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:06,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 13:05:06,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:06,206 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:05:06,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:06,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-12-13 13:05:06,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:06,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309900842] [2022-12-13 13:05:06,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:06,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:06,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:06,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309900842] [2022-12-13 13:05:06,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309900842] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:05:06,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124760704] [2022-12-13 13:05:06,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:05:06,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:06,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:05:06,381 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:05:06,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 13:05:06,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 13:05:06,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:05:06,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:05:06,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:05:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:06,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:05:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:05:06,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124760704] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:05:06,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:05:06,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 13:05:06,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460808351] [2022-12-13 13:05:06,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:05:06,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:05:06,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:06,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:05:06,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:05:06,521 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:05:06,613 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-12-13 13:05:06,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:05:06,613 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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 22 [2022-12-13 13:05:06,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:05:06,613 INFO L225 Difference]: With dead ends: 39 [2022-12-13 13:05:06,614 INFO L226 Difference]: Without dead ends: 31 [2022-12-13 13:05:06,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:05:06,615 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 44 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:05:06,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 24 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:05:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-13 13:05:06,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-12-13 13:05:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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-12-13 13:05:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-12-13 13:05:06,621 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-12-13 13:05:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:05:06,621 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-12-13 13:05:06,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-12-13 13:05:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 13:05:06,622 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:05:06,622 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:05:06,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 13:05:06,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 13:05:06,823 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:05:06,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:05:06,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-12-13 13:05:06,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:05:06,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705438009] [2022-12-13 13:05:06,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:05:06,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:05:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:05:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:05:08,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:05:08,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705438009] [2022-12-13 13:05:08,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705438009] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:05:08,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043506198] [2022-12-13 13:05:08,049 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 13:05:08,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:05:08,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:05:08,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:05:08,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 13:05:08,110 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 13:05:08,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:05:08,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 13:05:08,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:05:08,122 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 10 treesize of output 8 [2022-12-13 13:05:08,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:05:08,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 13:05:08,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 13:05:08,314 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 13:05:08,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:05:08,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-12-13 13:05:08,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:05:08,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:05:08,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-12-13 13:05:08,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-12-13 13:05:08,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2022-12-13 13:05:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:05:08,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:05:09,801 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:05:09,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 264 treesize of output 124 [2022-12-13 13:05:17,719 WARN L233 SmtUtils]: Spent 7.81s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:05:28,037 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:05:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:05:28,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043506198] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:05:28,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:05:28,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 50 [2022-12-13 13:05:28,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820042670] [2022-12-13 13:05:28,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:05:28,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-13 13:05:28,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:05:28,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-13 13:05:28,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2068, Unknown=0, NotChecked=0, Total=2450 [2022-12-13 13:05:28,168 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 50 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:05:36,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:06:18,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:06:18,460 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-12-13 13:06:18,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-13 13:06:18,460 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 13:06:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:06:18,461 INFO L225 Difference]: With dead ends: 99 [2022-12-13 13:06:18,461 INFO L226 Difference]: Without dead ends: 85 [2022-12-13 13:06:18,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2739 ImplicationChecksByTransitivity, 61.1s TimeCoverageRelationStatistics Valid=1371, Invalid=7371, Unknown=0, NotChecked=0, Total=8742 [2022-12-13 13:06:18,464 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 117 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 216 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-12-13 13:06:18,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 112 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 759 Invalid, 3 Unknown, 0 Unchecked, 8.8s Time] [2022-12-13 13:06:18,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-12-13 13:06:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 55. [2022-12-13 13:06:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:06:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-12-13 13:06:18,474 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 27 [2022-12-13 13:06:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:06:18,474 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-12-13 13:06:18,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:06:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-12-13 13:06:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 13:06:18,475 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:06:18,475 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:06:18,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 13:06:18,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:06:18,677 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:06:18,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:18,678 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-12-13 13:06:18,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:18,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516886201] [2022-12-13 13:06:18,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:18,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:06:19,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:19,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516886201] [2022-12-13 13:06:19,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516886201] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:06:19,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276990893] [2022-12-13 13:06:19,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:19,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:06:19,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:06:19,680 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:06:19,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 13:06:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:19,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 13:06:19,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:06:19,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 13:06:20,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:20,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 13:06:20,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 13:06:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:06:20,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:06:20,539 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 16 treesize of output 14 [2022-12-13 13:06:20,551 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 20 treesize of output 16 [2022-12-13 13:06:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:06:20,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276990893] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:06:20,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:06:20,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-12-13 13:06:20,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078589836] [2022-12-13 13:06:20,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:06:20,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:06:20,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:06:20,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:06:20,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:06:20,766 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:06:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:06:21,984 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2022-12-13 13:06:21,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:06:21,985 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 13:06:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:06:21,986 INFO L225 Difference]: With dead ends: 79 [2022-12-13 13:06:21,986 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 13:06:21,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:06:21,987 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 13:06:21,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 66 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 13:06:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 13:06:21,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2022-12-13 13:06:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:06:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2022-12-13 13:06:21,998 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 27 [2022-12-13 13:06:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:06:21,998 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2022-12-13 13:06:21,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:06:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2022-12-13 13:06:21,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 13:06:21,999 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:06:21,999 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:06:22,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 13:06:22,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:06:22,200 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:06:22,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:22,201 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-12-13 13:06:22,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:22,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124018760] [2022-12-13 13:06:22,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:22,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 13:06:22,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:22,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124018760] [2022-12-13 13:06:22,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124018760] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:06:22,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233825833] [2022-12-13 13:06:22,618 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 13:06:22,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:06:22,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:06:22,620 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:06:22,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 13:06:22,684 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 13:06:22,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:06:22,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 13:06:22,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:06:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 13:06:23,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:06:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 13:06:23,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233825833] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:06:23,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:06:23,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 13:06:23,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257930780] [2022-12-13 13:06:23,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:06:23,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:06:23,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:06:23,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:06:23,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:06:23,713 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:06:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:06:24,905 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-12-13 13:06:24,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:06:24,906 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 13:06:24,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:06:24,907 INFO L225 Difference]: With dead ends: 91 [2022-12-13 13:06:24,907 INFO L226 Difference]: Without dead ends: 53 [2022-12-13 13:06:24,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:06:24,908 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 13:06:24,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 34 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 13:06:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-13 13:06:24,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-12-13 13:06:24,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 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-12-13 13:06:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-12-13 13:06:24,918 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2022-12-13 13:06:24,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:06:24,918 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-12-13 13:06:24,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:06:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-12-13 13:06:24,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 13:06:24,919 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:06:24,919 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:06:24,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 13:06:25,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-13 13:06:25,121 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:06:25,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:25,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 6 times [2022-12-13 13:06:25,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:25,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867491758] [2022-12-13 13:06:25,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:25,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:06:25,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:25,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867491758] [2022-12-13 13:06:25,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867491758] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:06:25,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079438894] [2022-12-13 13:06:25,587 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 13:06:25,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:06:25,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:06:25,589 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:06:25,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 13:06:25,663 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-13 13:06:25,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:06:25,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 13:06:25,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:06:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 13:06:26,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:06:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 13:06:26,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079438894] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:06:26,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:06:26,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 13:06:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812470807] [2022-12-13 13:06:26,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:06:26,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:06:26,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:06:26,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:06:26,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:06:26,871 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:06:28,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:06:28,169 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-12-13 13:06:28,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:06:28,170 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 13:06:28,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:06:28,170 INFO L225 Difference]: With dead ends: 48 [2022-12-13 13:06:28,170 INFO L226 Difference]: Without dead ends: 38 [2022-12-13 13:06:28,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-12-13 13:06:28,171 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 13:06:28,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 26 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 13:06:28,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-13 13:06:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-12-13 13:06:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:06:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-12-13 13:06:28,179 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2022-12-13 13:06:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:06:28,179 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-12-13 13:06:28,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:06:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-12-13 13:06:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 13:06:28,180 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:06:28,180 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:06:28,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 13:06:28,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:06:28,382 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:06:28,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:28,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-12-13 13:06:28,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:28,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250252994] [2022-12-13 13:06:28,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:28,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:36,041 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:06:36,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:36,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250252994] [2022-12-13 13:06:36,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250252994] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:06:36,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768353329] [2022-12-13 13:06:36,042 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 13:06:36,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:06:36,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:06:36,043 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:06:36,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 13:06:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:36,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-13 13:06:36,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:06:36,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:06:36,165 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 10 treesize of output 8 [2022-12-13 13:06:36,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 13:06:36,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 13:06:36,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 13:06:37,704 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 13:06:38,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:38,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-12-13 13:06:40,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:40,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:40,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-12-13 13:06:41,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:06:41,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:41,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:41,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-12-13 13:06:42,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:42,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:42,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:06:42,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:06:42,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2022-12-13 13:06:43,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2022-12-13 13:06:44,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 35 [2022-12-13 13:06:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:06:44,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:06:55,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:06:55,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 836 treesize of output 258 [2022-12-13 13:06:58,041 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (+ .cse6 1)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (< .cse6 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 1)))))) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)))))) is different from false [2022-12-13 13:07:00,722 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (+ 2 .cse2) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (< (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (+ .cse2 4)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)))))) is different from false [2022-12-13 13:07:03,620 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (+ 7 .cse6)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (+ 5 .cse6) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))))) is different from false [2022-12-13 13:07:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-12-13 13:07:03,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768353329] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:07:03,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:07:03,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 62 [2022-12-13 13:07:03,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547128843] [2022-12-13 13:07:03,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:03,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-12-13 13:07:03,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:03,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-12-13 13:07:03,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=3048, Unknown=3, NotChecked=348, Total=3782 [2022-12-13 13:07:03,822 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:07:06,910 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (+ 7 .cse6)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (+ 5 .cse6) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse12 (select .cse18 .cse1)) (.cse11 (select .cse18 .cse0)) (.cse17 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse11 1)) (not (= .cse12 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| (+ 2 .cse17)) .cse1 (+ .cse12 2)) .cse0 (+ .cse11 2))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse13 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ 2 .cse13 .cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse13 .cse14 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse17))))) (* c_~N~0 3)) (not (= .cse17 1))))))) is different from false [2022-12-13 13:07:09,238 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)) (< (+ 2 .cse2) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (< (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (+ .cse2 4)) (not (= 3 (select v_arrayElimArr_4 .cse0))) (not (= (select v_arrayElimArr_4 .cse1) 3)))) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse12 (select .cse18 .cse1)) (.cse11 (select .cse18 .cse0)) (.cse17 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse11 1)) (not (= .cse12 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| (+ 2 .cse17)) .cse1 (+ .cse12 2)) .cse0 (+ .cse11 2))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse13 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ 2 .cse13 .cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse13 .cse14 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse17))))) (* c_~N~0 3)) (not (= .cse17 1))))) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-12-13 13:07:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:34,461 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2022-12-13 13:07:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 13:07:34,462 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 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 34 [2022-12-13 13:07:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:34,463 INFO L225 Difference]: With dead ends: 79 [2022-12-13 13:07:34,463 INFO L226 Difference]: Without dead ends: 75 [2022-12-13 13:07:34,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 49.2s TimeCoverageRelationStatistics Valid=579, Invalid=4266, Unknown=5, NotChecked=700, Total=5550 [2022-12-13 13:07:34,465 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:34,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 179 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1016 Invalid, 0 Unknown, 140 Unchecked, 9.8s Time] [2022-12-13 13:07:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-13 13:07:34,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51. [2022-12-13 13:07:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:07:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-12-13 13:07:34,476 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 34 [2022-12-13 13:07:34,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:34,476 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-12-13 13:07:34,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:07:34,476 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-12-13 13:07:34,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 13:07:34,477 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:34,477 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:07:34,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 13:07:34,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 13:07:34,679 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:07:34,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:34,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-12-13 13:07:34,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:34,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279181441] [2022-12-13 13:07:34,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:34,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 13:07:36,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:36,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279181441] [2022-12-13 13:07:36,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279181441] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:36,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609974875] [2022-12-13 13:07:36,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:07:36,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:36,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:36,176 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:36,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 13:07:36,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:07:36,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:07:36,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 13:07:36,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:36,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 13:07:37,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:37,361 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 25 treesize of output 24 [2022-12-13 13:07:37,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:37,652 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 25 treesize of output 24 [2022-12-13 13:07:37,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:07:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 13:07:38,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:07:38,930 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 16 treesize of output 14 [2022-12-13 13:07:38,945 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 20 treesize of output 16 [2022-12-13 13:07:39,424 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 13:07:39,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609974875] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:07:39,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:07:39,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-12-13 13:07:39,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950479053] [2022-12-13 13:07:39,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:39,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 13:07:39,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:39,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 13:07:39,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-12-13 13:07:39,427 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:07:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:44,211 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-12-13 13:07:44,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 13:07:44,212 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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 34 [2022-12-13 13:07:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:44,213 INFO L225 Difference]: With dead ends: 76 [2022-12-13 13:07:44,213 INFO L226 Difference]: Without dead ends: 61 [2022-12-13 13:07:44,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 13:07:44,214 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 43 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:44,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 66 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-13 13:07:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-13 13:07:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-12-13 13:07:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:07:44,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-12-13 13:07:44,228 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 34 [2022-12-13 13:07:44,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:44,228 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-12-13 13:07:44,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:07:44,229 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-12-13 13:07:44,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 13:07:44,229 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:44,229 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:07:44,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 13:07:44,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:44,430 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:07:44,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:44,431 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-12-13 13:07:44,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:44,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430170016] [2022-12-13 13:07:44,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:44,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 13:07:45,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:45,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430170016] [2022-12-13 13:07:45,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430170016] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:45,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930554897] [2022-12-13 13:07:45,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:07:45,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:45,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:45,063 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:45,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 13:07:45,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:07:45,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:07:45,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 13:07:45,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 13:07:46,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:07:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 13:07:46,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930554897] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:07:46,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:07:46,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-12-13 13:07:46,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140983472] [2022-12-13 13:07:46,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:46,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:07:46,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:46,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:07:46,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:07:46,971 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 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-12-13 13:07:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:48,475 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-12-13 13:07:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:07:48,476 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 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) Word has length 36 [2022-12-13 13:07:48,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:48,476 INFO L225 Difference]: With dead ends: 102 [2022-12-13 13:07:48,476 INFO L226 Difference]: Without dead ends: 62 [2022-12-13 13:07:48,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-12-13 13:07:48,477 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 80 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:48,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 36 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 13:07:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-13 13:07:48,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-12-13 13:07:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:07:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-12-13 13:07:48,489 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2022-12-13 13:07:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:48,489 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-12-13 13:07:48,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 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-12-13 13:07:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-12-13 13:07:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 13:07:48,490 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:48,490 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:07:48,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 13:07:48,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 13:07:48,691 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:07:48,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:48,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1466624367, now seen corresponding path program 9 times [2022-12-13 13:07:48,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:48,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785929585] [2022-12-13 13:07:48,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:48,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 13:07:49,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:49,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785929585] [2022-12-13 13:07:49,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785929585] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:49,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848891540] [2022-12-13 13:07:49,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:07:49,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:49,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:49,367 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:49,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 13:07:49,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-13 13:07:49,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:07:49,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 13:07:49,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 13:07:50,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:07:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 13:07:51,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848891540] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:07:51,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:07:51,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-12-13 13:07:51,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747688904] [2022-12-13 13:07:51,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:51,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:07:51,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:51,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:07:51,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:07:51,312 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:07:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:53,305 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-12-13 13:07:53,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:07:53,306 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 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 36 [2022-12-13 13:07:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:53,306 INFO L225 Difference]: With dead ends: 57 [2022-12-13 13:07:53,307 INFO L226 Difference]: Without dead ends: 45 [2022-12-13 13:07:53,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-12-13 13:07:53,307 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:53,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 21 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-13 13:07:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-12-13 13:07:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-12-13 13:07:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:07:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-12-13 13:07:53,320 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 36 [2022-12-13 13:07:53,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:53,321 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-12-13 13:07:53,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:07:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-12-13 13:07:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 13:07:53,322 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:53,322 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:07:53,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 13:07:53,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 13:07:53,524 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:07:53,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:53,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-12-13 13:07:53,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:53,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373005159] [2022-12-13 13:07:53,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:53,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:08:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:08:06,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:08:06,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373005159] [2022-12-13 13:08:06,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373005159] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:08:06,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554713074] [2022-12-13 13:08:06,939 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 13:08:06,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:08:06,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:08:06,941 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:08:06,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 13:08:07,036 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 13:08:07,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:08:07,038 WARN L261 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 99 conjunts are in the unsatisfiable core [2022-12-13 13:08:07,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:08:07,054 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 11 treesize of output 7 [2022-12-13 13:08:07,098 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 10 treesize of output 8 [2022-12-13 13:08:07,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 13:08:07,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 13:08:08,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 13:08:08,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 13:08:10,538 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 13:08:11,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 45 [2022-12-13 13:08:13,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:13,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:13,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:13,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52 [2022-12-13 13:08:15,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:15,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:15,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:15,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2022-12-13 13:08:17,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:08:17,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:17,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:17,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:17,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2022-12-13 13:08:19,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:19,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:19,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:19,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:19,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:08:19,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:19,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:19,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2022-12-13 13:08:20,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:20,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:20,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:20,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:20,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:20,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:08:20,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:08:20,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2022-12-13 13:08:22,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 63 [2022-12-13 13:08:23,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 42 [2022-12-13 13:08:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:08:23,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:08:54,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:08:54,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 2288 treesize of output 520 [2022-12-13 13:08:57,006 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse3)) (< (+ 2 .cse4) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse5 .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse3 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3 .cse9)))))))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse14 .cse15)))))) (+ .cse4 4)) (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse14))))))) is different from false [2022-12-13 13:08:59,591 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse3)) (< (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3 .cse8)))))) (+ 7 .cse9))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse14 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (+ 5 .cse9) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse10 .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse14 .cse15))))))) (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse14))))))) is different from false [2022-12-13 13:09:02,926 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse6 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse0 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse4 .cse5)))))) (+ .cse9 10)) (not (= (select v_arrayElimArr_5 .cse8) 3)) (not (= 3 (select v_arrayElimArr_5 .cse6))) (not (= (select v_arrayElimArr_5 .cse7) 3)) (not (= 3 .cse4))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse8) 3)) (not (= 3 (select v_arrayElimArr_5 .cse6))) (not (= (select v_arrayElimArr_5 .cse7) 3)) (not (= 3 .cse10)) (< (+ .cse9 8) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse11 .cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse10 .cse15)))))))))))) is different from false [2022-12-13 13:09:05,873 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse3)) (< (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3 .cse8)))))) (+ .cse9 13))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 3)) (not (= 3 (select v_arrayElimArr_5 .cse1))) (not (= (select v_arrayElimArr_5 .cse2) 3)) (not (= 3 .cse10)) (< (+ .cse9 11) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse11 .cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse10 .cse15)))))))))))) is different from false [2022-12-13 13:09:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-12-13 13:09:06,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554713074] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:09:06,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:09:06,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 83 [2022-12-13 13:09:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780017257] [2022-12-13 13:09:06,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:09:06,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-12-13 13:09:06,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:09:06,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-12-13 13:09:06,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=5424, Unknown=4, NotChecked=628, Total=6806 [2022-12-13 13:09:06,223 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 83 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:10,542 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse19 (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse8 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse11 .cse10)) (.cse0 (select .cse11 .cse9)) (.cse7 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (select .cse11 .cse8))) (or (not (= .cse0 1)) (not (= .cse1 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (* c_~N~0 3) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ 2 .cse7)) .cse10 (+ .cse1 2)) .cse9 (+ .cse0 2)) .cse8 (+ 2 .cse12))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse6 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 2 .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 2 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 2 .cse5 .cse6 .cse7))))))) (not (= .cse7 1)) (not (= .cse12 1))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse13 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse10) 3)) (not (= 3 (select v_arrayElimArr_5 .cse8))) (not (= (select v_arrayElimArr_5 .cse9) 3)) (not (= 3 .cse13)) (< (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse14 .cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse13 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse13 .cse18)))))) (+ .cse19 13))))) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse20 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse10) 3)) (not (= 3 (select v_arrayElimArr_5 .cse8))) (not (= (select v_arrayElimArr_5 .cse9) 3)) (not (= 3 .cse20)) (< (+ .cse19 11) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse21 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse20 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse21 .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse20 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse20 .cse25)))))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-12-13 13:09:13,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2022-12-13 13:09:13,068 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-13 13:09:13,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:09:13,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2371 ImplicationChecksByTransitivity, 61.8s TimeCoverageRelationStatistics Valid=752, Invalid=5425, Unknown=5, NotChecked=790, Total=6972 [2022-12-13 13:09:13,070 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-13 13:09:13,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 15 Unchecked, 1.7s Time] [2022-12-13 13:09:13,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 13:09:13,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 13:09:13,272 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:898) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:772) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 48 more [2022-12-13 13:09:13,281 INFO L158 Benchmark]: Toolchain (without parser) took 251866.47ms. Allocated memory was 117.4MB in the beginning and 163.6MB in the end (delta: 46.1MB). Free memory was 76.6MB in the beginning and 88.9MB in the end (delta: -12.2MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2022-12-13 13:09:13,281 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:09:13,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.18ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 65.6MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 13:09:13,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.51ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 64.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:09:13,282 INFO L158 Benchmark]: Boogie Preprocessor took 18.86ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 62.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:09:13,282 INFO L158 Benchmark]: RCFGBuilder took 254.54ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 50.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 13:09:13,282 INFO L158 Benchmark]: TraceAbstraction took 251381.82ms. Allocated memory was 117.4MB in the beginning and 163.6MB in the end (delta: 46.1MB). Free memory was 50.3MB in the beginning and 88.9MB in the end (delta: -38.5MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-12-13 13:09:13,283 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.18ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 65.6MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.51ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 64.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.86ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 62.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 254.54ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 50.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 251381.82ms. Allocated memory was 117.4MB in the beginning and 163.6MB in the end (delta: 46.1MB). Free memory was 50.3MB in the beginning and 88.9MB in the end (delta: -38.5MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s2lif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8 --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 b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 13:09:14,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:09:14,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:09:14,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:09:14,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:09:14,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:09:14,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:09:14,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:09:14,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:09:14,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:09:14,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:09:14,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:09:14,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:09:14,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:09:14,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:09:14,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:09:14,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:09:14,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:09:14,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:09:14,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:09:14,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:09:14,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:09:14,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:09:14,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:09:14,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:09:14,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:09:14,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:09:14,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:09:14,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:09:14,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:09:14,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:09:14,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:09:14,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:09:14,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:09:14,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:09:14,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:09:14,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:09:14,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:09:14,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:09:14,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:09:14,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:09:14,651 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-12-13 13:09:14,677 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:09:14,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:09:14,678 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:09:14,678 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:09:14,678 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:09:14,679 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:09:14,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:09:14,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:09:14,680 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:09:14,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:09:14,680 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:09:14,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:09:14,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:09:14,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:09:14,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:09:14,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:09:14,681 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 13:09:14,682 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 13:09:14,682 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 13:09:14,682 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:09:14,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:09:14,682 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:09:14,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:09:14,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:09:14,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:09:14,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:09:14,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:09:14,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:09:14,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:09:14,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:09:14,684 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 13:09:14,684 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 13:09:14,684 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:09:14,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:09:14,684 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:09:14,684 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:09:14,684 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 13:09:14,684 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:09:14,685 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/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_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8 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 -> b94168e93e7008f2fa8921a5a8a54bdf1fdce85df40220d4719fdc5076df164f [2022-12-13 13:09:14,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:09:14,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:09:14,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:09:14,952 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:09:14,953 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:09:14,953 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/array-fpi/s2lif.c [2022-12-13 13:09:17,510 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:09:17,679 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:09:17,680 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/sv-benchmarks/c/array-fpi/s2lif.c [2022-12-13 13:09:17,687 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/data/55ee57f38/32396b42a0964f85a1adef6007f26b91/FLAG6454a3713 [2022-12-13 13:09:17,702 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/data/55ee57f38/32396b42a0964f85a1adef6007f26b91 [2022-12-13 13:09:17,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:09:17,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:09:17,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:09:17,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:09:17,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:09:17,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:09:17" (1/1) ... [2022-12-13 13:09:17,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e986e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:17, skipping insertion in model container [2022-12-13 13:09:17,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:09:17" (1/1) ... [2022-12-13 13:09:17,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:09:17,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:09:17,870 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_09c2e780-7736-43de-b4fd-df37a85b29b6/sv-benchmarks/c/array-fpi/s2lif.c[588,601] [2022-12-13 13:09:17,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:09:17,903 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:09:17,917 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_09c2e780-7736-43de-b4fd-df37a85b29b6/sv-benchmarks/c/array-fpi/s2lif.c[588,601] [2022-12-13 13:09:17,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:09:17,942 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:09:17,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:17 WrapperNode [2022-12-13 13:09:17,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:09:17,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:09:17,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:09:17,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:09:17,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:17" (1/1) ... [2022-12-13 13:09:17,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:17" (1/1) ... [2022-12-13 13:09:17,978 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-12-13 13:09:17,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:09:17,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:09:17,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:09:17,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:09:17,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:17" (1/1) ... [2022-12-13 13:09:17,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:17" (1/1) ... [2022-12-13 13:09:17,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:17" (1/1) ... [2022-12-13 13:09:17,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:17" (1/1) ... [2022-12-13 13:09:17,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:17" (1/1) ... [2022-12-13 13:09:18,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:17" (1/1) ... [2022-12-13 13:09:18,003 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:17" (1/1) ... [2022-12-13 13:09:18,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:17" (1/1) ... [2022-12-13 13:09:18,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:09:18,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:09:18,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:09:18,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:09:18,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:17" (1/1) ... [2022-12-13 13:09:18,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:09:18,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:09:18,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:09:18,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:09:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:09:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 13:09:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:09:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-12-13 13:09:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 13:09:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 13:09:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:09:18,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:09:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-12-13 13:09:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:09:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 13:09:18,141 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:09:18,143 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:09:18,325 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:09:18,331 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:09:18,331 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 13:09:18,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:09:18 BoogieIcfgContainer [2022-12-13 13:09:18,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:09:18,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:09:18,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:09:18,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:09:18,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:09:17" (1/3) ... [2022-12-13 13:09:18,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250bbe57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:09:18, skipping insertion in model container [2022-12-13 13:09:18,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:09:17" (2/3) ... [2022-12-13 13:09:18,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250bbe57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:09:18, skipping insertion in model container [2022-12-13 13:09:18,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:09:18" (3/3) ... [2022-12-13 13:09:18,340 INFO L112 eAbstractionObserver]: Analyzing ICFG s2lif.c [2022-12-13 13:09:18,358 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:09:18,359 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:09:18,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:09:18,412 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;@61ccea6c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:09:18,412 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 13:09:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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-12-13 13:09:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 13:09:18,421 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:09:18,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:18,422 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:09:18,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:18,426 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-12-13 13:09:18,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:09:18,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417507042] [2022-12-13 13:09:18,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:18,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:09:18,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:09:18,438 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:09:18,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 13:09:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:18,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 13:09:18,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:09:18,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:18,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:09:18,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:09:18,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417507042] [2022-12-13 13:09:18,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417507042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:18,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:18,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:09:18,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192326871] [2022-12-13 13:09:18,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:18,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 13:09:18,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:09:18,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 13:09:18,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:09:18,591 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-12-13 13:09:18,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:09:18,603 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-12-13 13:09:18,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 13:09:18,604 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-12-13 13:09:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:09:18,611 INFO L225 Difference]: With dead ends: 40 [2022-12-13 13:09:18,612 INFO L226 Difference]: Without dead ends: 18 [2022-12-13 13:09:18,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:09:18,618 INFO L413 NwaCegarLoop]: 26 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, 26 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-12-13 13:09:18,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:09:18,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-13 13:09:18,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-12-13 13:09:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-12-13 13:09:18,643 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-12-13 13:09:18,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:09:18,644 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-12-13 13:09:18,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-12-13 13:09:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-12-13 13:09:18,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 13:09:18,645 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:09:18,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:18,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:09:18,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:09:18,846 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:09:18,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-12-13 13:09:18,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:09:18,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938448855] [2022-12-13 13:09:18,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:18,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:09:18,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:09:18,849 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:09:18,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 13:09:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:18,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:09:18,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:09:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:19,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:09:19,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:09:19,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938448855] [2022-12-13 13:09:19,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938448855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:09:19,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:09:19,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:09:19,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809378264] [2022-12-13 13:09:19,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:09:19,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:09:19,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:09:19,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:09:19,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:09:19,028 INFO L87 Difference]: Start difference. First operand 18 states and 21 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-12-13 13:09:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:09:19,166 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-12-13 13:09:19,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:09:19,167 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-12-13 13:09:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:09:19,167 INFO L225 Difference]: With dead ends: 36 [2022-12-13 13:09:19,168 INFO L226 Difference]: Without dead ends: 25 [2022-12-13 13:09:19,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:09:19,170 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 55 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:09:19,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 9 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:09:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-13 13:09:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-12-13 13:09:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-12-13 13:09:19,177 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-12-13 13:09:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:09:19,177 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-12-13 13:09:19,177 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-12-13 13:09:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-12-13 13:09:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 13:09:19,178 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:09:19,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:19,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 13:09:19,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:09:19,381 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:09:19,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:19,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-12-13 13:09:19,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:09:19,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19631588] [2022-12-13 13:09:19,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:19,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:09:19,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:09:19,391 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:09:19,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 13:09:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:19,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 13:09:19,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:09:19,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:09:19,688 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 18 treesize of output 19 [2022-12-13 13:09:19,703 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 10 treesize of output 8 [2022-12-13 13:09:19,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:09:19,769 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 34 treesize of output 36 [2022-12-13 13:09:20,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:09:20,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2022-12-13 13:09:20,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:09:20,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 47 [2022-12-13 13:09:20,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:09:20,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 52 [2022-12-13 13:09:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:20,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:09:27,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:09:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:27,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:09:27,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19631588] [2022-12-13 13:09:27,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19631588] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:09:27,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:09:27,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-12-13 13:09:27,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049782166] [2022-12-13 13:09:27,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:09:27,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 13:09:27,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:09:27,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 13:09:27,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=448, Unknown=1, NotChecked=0, Total=552 [2022-12-13 13:09:27,368 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:40,501 WARN L233 SmtUtils]: Spent 7.52s on a formula simplification. DAG size of input: 65 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:09:40,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:09:40,785 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-12-13 13:09:40,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 13:09:40,786 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 13:09:40,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:09:40,786 INFO L225 Difference]: With dead ends: 49 [2022-12-13 13:09:40,786 INFO L226 Difference]: Without dead ends: 39 [2022-12-13 13:09:40,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=289, Invalid=1192, Unknown=1, NotChecked=0, Total=1482 [2022-12-13 13:09:40,788 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 68 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:09:40,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 53 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-13 13:09:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-12-13 13:09:40,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-12-13 13:09:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-12-13 13:09:40,796 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2022-12-13 13:09:40,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:09:40,797 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-12-13 13:09:40,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-12-13 13:09:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 13:09:40,798 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:09:40,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:40,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-12-13 13:09:40,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:09:41,000 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:09:41,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-12-13 13:09:41,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:09:41,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484250958] [2022-12-13 13:09:41,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:41,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:09:41,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:09:41,005 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:09:41,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 13:09:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:41,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:09:41,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:09:41,064 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 11 treesize of output 7 [2022-12-13 13:09:41,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:09:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:09:41,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:09:41,146 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 14 treesize of output 12 [2022-12-13 13:09:41,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-13 13:09:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:09:41,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:09:41,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484250958] [2022-12-13 13:09:41,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484250958] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:09:41,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:09:41,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-12-13 13:09:41,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826487505] [2022-12-13 13:09:41,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:09:41,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:09:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:09:41,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:09:41,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:09:41,167 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:09:41,331 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-12-13 13:09:41,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:09:41,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 13:09:41,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:09:41,332 INFO L225 Difference]: With dead ends: 49 [2022-12-13 13:09:41,332 INFO L226 Difference]: Without dead ends: 38 [2022-12-13 13:09:41,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:09:41,333 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:09:41,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:09:41,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-13 13:09:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-12-13 13:09:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 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-12-13 13:09:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-12-13 13:09:41,338 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2022-12-13 13:09:41,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:09:41,339 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-12-13 13:09:41,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-12-13 13:09:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 13:09:41,339 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:09:41,339 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:41,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 13:09:41,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:09:41,541 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:09:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:41,542 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-12-13 13:09:41,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:09:41,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357823592] [2022-12-13 13:09:41,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:09:41,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:09:41,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:09:41,547 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:09:41,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 13:09:41,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:09:41,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:09:41,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 13:09:41,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:09:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:09:41,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:09:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:09:41,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:09:41,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357823592] [2022-12-13 13:09:41,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357823592] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:09:41,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:09:41,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2022-12-13 13:09:41,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124733908] [2022-12-13 13:09:41,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:09:41,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:09:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:09:41,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:09:41,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:09:41,976 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:09:42,520 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-12-13 13:09:42,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:09:42,521 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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 22 [2022-12-13 13:09:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:09:42,521 INFO L225 Difference]: With dead ends: 63 [2022-12-13 13:09:42,521 INFO L226 Difference]: Without dead ends: 40 [2022-12-13 13:09:42,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-12-13 13:09:42,522 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 122 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:09:42,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 27 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 13:09:42,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-13 13:09:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2022-12-13 13:09:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:42,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-12-13 13:09:42,527 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-12-13 13:09:42,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:09:42,527 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-12-13 13:09:42,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:42,528 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-12-13 13:09:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 13:09:42,528 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:09:42,528 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:42,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 13:09:42,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:09:42,730 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:09:42,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-12-13 13:09:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:09:42,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082753695] [2022-12-13 13:09:42,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:09:42,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:09:42,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:09:42,735 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:09:42,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 13:09:42,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 13:09:42,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:09:42,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 13:09:42,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:09:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:09:43,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:09:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:09:43,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:09:43,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082753695] [2022-12-13 13:09:43,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082753695] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:09:43,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:09:43,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2022-12-13 13:09:43,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468421420] [2022-12-13 13:09:43,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:09:43,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 13:09:43,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:09:43,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 13:09:43,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-12-13 13:09:43,306 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:09:44,073 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-12-13 13:09:44,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:09:44,073 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 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 22 [2022-12-13 13:09:44,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:09:44,074 INFO L225 Difference]: With dead ends: 72 [2022-12-13 13:09:44,074 INFO L226 Difference]: Without dead ends: 57 [2022-12-13 13:09:44,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2022-12-13 13:09:44,075 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 276 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:09:44,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 23 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 13:09:44,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-13 13:09:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2022-12-13 13:09:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-12-13 13:09:44,081 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 22 [2022-12-13 13:09:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:09:44,081 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-12-13 13:09:44,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:09:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-12-13 13:09:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 13:09:44,082 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:09:44,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:09:44,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 13:09:44,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:09:44,284 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:09:44,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:44,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-12-13 13:09:44,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:09:44,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326691101] [2022-12-13 13:09:44,287 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 13:09:44,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:09:44,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:09:44,290 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:09:44,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 13:09:44,392 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 13:09:44,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:09:44,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 13:09:44,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:09:44,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:09:44,451 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 18 treesize of output 19 [2022-12-13 13:09:44,470 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 10 treesize of output 8 [2022-12-13 13:09:44,530 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 25 treesize of output 25 [2022-12-13 13:09:44,610 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 25 treesize of output 25 [2022-12-13 13:09:44,922 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:09:44,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-12-13 13:09:45,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:09:45,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 49 [2022-12-13 13:09:45,487 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 13:09:45,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 70 [2022-12-13 13:09:45,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:09:45,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 73 [2022-12-13 13:09:45,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:09:45,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 83 [2022-12-13 13:09:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:09:46,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:10:29,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:10:29,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 653 treesize of output 289 [2022-12-13 13:10:39,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:10:39,318 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 13:10:39,318 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 2 case distinctions, treesize of input 562 treesize of output 1 [2022-12-13 13:10:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:39,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:10:39,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326691101] [2022-12-13 13:10:39,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326691101] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:10:39,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:10:39,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2022-12-13 13:10:39,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705367824] [2022-12-13 13:10:39,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:10:39,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 13:10:39,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:10:39,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 13:10:39,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1059, Unknown=18, NotChecked=0, Total=1260 [2022-12-13 13:10:39,323 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 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-12-13 13:10:48,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:10:50,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:10:55,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:10:57,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:11:00,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:11:11,362 WARN L233 SmtUtils]: Spent 7.75s on a formula simplification. DAG size of input: 120 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:11:27,376 WARN L233 SmtUtils]: Spent 15.49s on a formula simplification. DAG size of input: 99 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:12:00,986 WARN L233 SmtUtils]: Spent 22.41s on a formula simplification. DAG size of input: 157 DAG size of output: 147 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:12:03,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:12:06,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:12:08,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:12:10,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:12:12,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:12:14,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:12:16,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:12:18,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:12:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:12:25,551 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-12-13 13:12:25,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 13:12:25,552 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 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) Word has length 27 [2022-12-13 13:12:25,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:12:25,553 INFO L225 Difference]: With dead ends: 64 [2022-12-13 13:12:25,553 INFO L226 Difference]: Without dead ends: 52 [2022-12-13 13:12:25,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 125.8s TimeCoverageRelationStatistics Valid=512, Invalid=2890, Unknown=20, NotChecked=0, Total=3422 [2022-12-13 13:12:25,554 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 84 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 33 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:12:25,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 62 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 570 Invalid, 12 Unknown, 0 Unchecked, 33.3s Time] [2022-12-13 13:12:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-13 13:12:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2022-12-13 13:12:25,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-12-13 13:12:25,562 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 27 [2022-12-13 13:12:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:12:25,562 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-12-13 13:12:25,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 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-12-13 13:12:25,563 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-12-13 13:12:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 13:12:25,563 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:12:25,563 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:25,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 13:12:25,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:12:25,765 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:12:25,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:25,766 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-12-13 13:12:25,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:12:25,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444378193] [2022-12-13 13:12:25,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:12:25,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:12:25,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:12:25,771 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:12:25,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 13:12:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:12:25,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:12:25,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:25,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 13:12:26,152 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 13:12:26,152 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 25 treesize of output 24 [2022-12-13 13:12:26,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 13:12:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:12:26,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:26,495 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 16 treesize of output 14 [2022-12-13 13:12:26,502 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 20 treesize of output 16 [2022-12-13 13:12:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:12:26,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:12:26,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444378193] [2022-12-13 13:12:26,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444378193] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:26,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:12:26,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-12-13 13:12:26,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646111759] [2022-12-13 13:12:26,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:26,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:12:26,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:12:26,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:12:26,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:12:26,628 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:12:27,481 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-12-13 13:12:27,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:12:27,483 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 13:12:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:12:27,483 INFO L225 Difference]: With dead ends: 69 [2022-12-13 13:12:27,483 INFO L226 Difference]: Without dead ends: 40 [2022-12-13 13:12:27,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:12:27,484 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 13:12:27,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 59 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 13:12:27,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-13 13:12:27,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-12-13 13:12:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 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-12-13 13:12:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-12-13 13:12:27,492 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 27 [2022-12-13 13:12:27,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:12:27,492 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-12-13 13:12:27,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:27,492 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-12-13 13:12:27,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 13:12:27,493 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:12:27,493 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:27,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 13:12:27,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:12:27,695 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:12:27,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:27,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 5 times [2022-12-13 13:12:27,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:12:27,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000634812] [2022-12-13 13:12:27,698 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 13:12:27,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:12:27,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:12:27,701 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:12:27,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 13:12:27,812 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 13:12:27,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:12:27,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 13:12:27,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:29,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:12:29,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:12:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:12:30,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:12:30,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000634812] [2022-12-13 13:12:30,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000634812] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:12:30,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:12:30,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2022-12-13 13:12:30,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629737329] [2022-12-13 13:12:30,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:12:30,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 13:12:30,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:12:30,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 13:12:30,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2022-12-13 13:12:30,681 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:34,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:12:34,298 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2022-12-13 13:12:34,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 13:12:34,299 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 13:12:34,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:12:34,300 INFO L225 Difference]: With dead ends: 88 [2022-12-13 13:12:34,300 INFO L226 Difference]: Without dead ends: 69 [2022-12-13 13:12:34,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 13:12:34,301 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 325 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:12:34,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 23 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-13 13:12:34,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-13 13:12:34,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2022-12-13 13:12:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-12-13 13:12:34,315 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 29 [2022-12-13 13:12:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:12:34,315 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-12-13 13:12:34,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:12:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-12-13 13:12:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 13:12:34,316 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:12:34,316 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:12:34,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-12-13 13:12:34,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:12:34,518 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:12:34,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:12:34,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 6 times [2022-12-13 13:12:34,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:12:34,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765866345] [2022-12-13 13:12:34,520 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 13:12:34,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:12:34,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:12:34,524 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:12:34,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09c2e780-7736-43de-b4fd-df37a85b29b6/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 13:12:34,762 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-13 13:12:34,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:12:34,768 WARN L261 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-13 13:12:34,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:12:34,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:12:34,964 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 18 treesize of output 19 [2022-12-13 13:12:35,010 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 10 treesize of output 8 [2022-12-13 13:12:35,119 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 25 treesize of output 25 [2022-12-13 13:12:35,361 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 25 treesize of output 25 [2022-12-13 13:12:35,570 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 25 treesize of output 25 [2022-12-13 13:12:36,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:12:36,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-12-13 13:12:37,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:12:37,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 56 [2022-12-13 13:12:38,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:12:38,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 61 [2022-12-13 13:12:38,827 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-13 13:12:38,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 108 treesize of output 82 [2022-12-13 13:12:40,083 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-13 13:12:40,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 96 [2022-12-13 13:12:41,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:12:41,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 174 treesize of output 113 [2022-12-13 13:12:42,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:12:42,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 232 treesize of output 142 [2022-12-13 13:12:42,395 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:12:42,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:14:54,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:14:54,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 3961 treesize of output 1239 [2022-12-13 13:15:22,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:15:22,196 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 13:15:22,196 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 2 case distinctions, treesize of input 2506 treesize of output 1 [2022-12-13 13:15:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:15:22,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:15:22,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765866345] [2022-12-13 13:15:22,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765866345] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:15:22,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:15:22,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2022-12-13 13:15:22,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489141907] [2022-12-13 13:15:22,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:15:22,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-13 13:15:22,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:15:22,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-13 13:15:22,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1818, Unknown=35, NotChecked=0, Total=2162 [2022-12-13 13:15:22,204 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 47 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:18,765 WARN L233 SmtUtils]: Spent 38.04s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:16:19,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:16:21,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:16:23,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:16:26,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:16:28,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:16:30,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:16:32,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:16:34,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:16:36,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:16:54,062 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse78 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse95 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse78)) (.cse73 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse93 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse78))) (let ((.cse80 (select .cse73 .cse93)) (.cse91 (select .cse73 .cse95))) (let ((.cse22 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse78)) (.cse57 (store .cse73 .cse95 (bvadd (_ bv2 32) .cse91))) (.cse94 (bvadd (_ bv2 32) .cse80))) (let ((.cse24 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv3 32)))) (.cse13 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse15 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse21 (store .cse57 .cse93 .cse94)) (.cse92 (select .cse73 .cse22))) (let ((.cse2 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse35 (store .cse73 .cse93 .cse94)) (.cse23 (bvadd (_ bv2 32) .cse92)) (.cse6 (not (= .cse92 (_ bv1 32)))) (.cse5 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse0 (bvule c_~N~0 (_ bv536870911 32))) (.cse58 (not (= .cse91 (_ bv1 32)))) (.cse1 (= .cse24 (let ((.cse81 (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21))) (let ((.cse89 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse90 (bvadd ((_ sign_extend 32) (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse89 .cse12) (select .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse88 ((_ extract 31 0) .cse90)) (.cse87 ((_ extract 63 32) .cse90))) (let ((.cse85 (store (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse88) .cse12 .cse87))) (let ((.cse86 (bvadd ((_ sign_extend 32) (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse85) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) (concat .cse87 .cse88)))) (let ((.cse83 ((_ extract 31 0) .cse86)) (.cse82 ((_ extract 63 32) .cse86))) (bvadd (concat .cse82 .cse83) ((_ sign_extend 32) (select (select (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse85 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse83) .cse12 .cse82)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)))))))))))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81))))) (.cse59 (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse3 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse4 (not (= .cse80 (_ bv1 32)))) (.cse79 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (and (or (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (not .cse0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (or .cse1 .cse2 .cse3 .cse4) (not (bvslt (_ bv3 32) c_~N~0)) (or .cse5 .cse2 .cse6 (= (let ((.cse7 (let ((.cse20 (store .cse21 .cse22 .cse23))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse20))) (let ((.cse18 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (bvadd (concat (select .cse18 .cse12) (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse17 ((_ extract 31 0) .cse19)) (.cse16 ((_ extract 63 32) .cse19))) (let ((.cse11 (store (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17) .cse12 .cse16))) (let ((.cse14 (bvadd ((_ sign_extend 32) (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse11) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) (concat .cse16 .cse17)))) (let ((.cse9 ((_ extract 31 0) .cse14)) (.cse8 ((_ extract 63 32) .cse14))) (bvadd (concat .cse8 .cse9) ((_ sign_extend 32) (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse9) .cse12 .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))))))))))))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))) .cse24) .cse3 .cse4) (or (= .cse24 (let ((.cse25 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35))) (let ((.cse33 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (bvadd (concat (select .cse33 .cse12) (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse32 ((_ extract 31 0) .cse34)) (.cse31 ((_ extract 63 32) .cse34))) (let ((.cse29 (store (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse32) .cse12 .cse31))) (let ((.cse30 (bvadd ((_ sign_extend 32) (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse29) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) (concat .cse31 .cse32)))) (let ((.cse27 ((_ extract 31 0) .cse30)) (.cse26 ((_ extract 63 32) .cse30))) (bvadd (concat .cse26 .cse27) ((_ sign_extend 32) (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse27) .cse12 .cse26)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)))))))))))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25)))) .cse3 .cse4) (not (bvsle c_~N~0 (_ bv0 32))) (or (= .cse24 (let ((.cse36 (let ((.cse46 (store .cse35 .cse22 .cse23))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46))) (let ((.cse44 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (bvadd (concat (select .cse44 .cse12) (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse43 ((_ extract 31 0) .cse45)) (.cse42 ((_ extract 63 32) .cse45))) (let ((.cse38 (store (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse43) .cse12 .cse42))) (let ((.cse41 (bvadd ((_ sign_extend 32) (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse38) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) (concat .cse42 .cse43)))) (let ((.cse40 ((_ extract 63 32) .cse41)) (.cse39 ((_ extract 31 0) .cse41))) (bvadd ((_ sign_extend 32) (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse39) .cse12 .cse40)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)) (concat .cse40 .cse39)))))))))))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36)))) .cse5 .cse6 .cse3 .cse4) (or (= .cse24 (let ((.cse47 (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse57))) (let ((.cse55 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (bvadd (concat (select .cse55 .cse12) (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse57 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse54 ((_ extract 31 0) .cse56)) (.cse53 ((_ extract 63 32) .cse56))) (let ((.cse51 (store (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse54) .cse12 .cse53))) (let ((.cse52 (bvadd ((_ sign_extend 32) (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse51) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) (concat .cse53 .cse54)))) (let ((.cse49 ((_ extract 31 0) .cse52)) (.cse48 ((_ extract 63 32) .cse52))) (bvadd (concat .cse48 .cse49) ((_ sign_extend 32) (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse49) .cse12 .cse48)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13)))))))))))) (concat ((_ extract 63 32) .cse47) ((_ extract 31 0) .cse47)))) .cse58 .cse59) (or .cse5 (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32))) (let ((.cse75 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset| .cse78)) (.cse77 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset| .cse78)) (.cse74 (bvadd |ULTIMATE.start_main_~a~0#1.offset| .cse78))) (let ((.cse60 (select .cse73 .cse74)) (.cse61 (select .cse73 .cse77)) (.cse76 (select .cse73 .cse75))) (or (not (= .cse60 (_ bv1 32))) (not (= .cse61 (_ bv1 32))) (= .cse24 (let ((.cse62 (let ((.cse72 (store (store (store .cse73 .cse74 (bvadd (_ bv2 32) .cse60)) .cse75 (bvadd (_ bv2 32) .cse76)) .cse77 (bvadd (_ bv2 32) .cse61)))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse72))) (let ((.cse70 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse71 (bvadd ((_ sign_extend 32) (select .cse72 |ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse70 .cse12) (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse69 ((_ extract 31 0) .cse71)) (.cse68 ((_ extract 63 32) .cse71))) (let ((.cse66 (store (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse69) .cse12 .cse68))) (let ((.cse67 (bvadd ((_ sign_extend 32) (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse66) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|))) (concat .cse68 .cse69)))) (let ((.cse64 ((_ extract 31 0) .cse67)) (.cse63 ((_ extract 63 32) .cse67))) (bvadd (concat .cse63 .cse64) ((_ sign_extend 32) (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse64) .cse12 .cse63)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))))))))))))) (concat ((_ extract 63 32) .cse62) ((_ extract 31 0) .cse62)))) (not (= .cse76 (_ bv1 32))))))) .cse3) (= (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) (= ((_ extract 31 0) (_ bv0 64)) (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) .cse0 (or .cse58 .cse1 .cse59 .cse3 .cse4) (= (select .cse79 .cse12) ((_ extract 63 32) (_ bv0 64)))))))))) is different from true [2022-12-13 13:17:49,128 WARN L233 SmtUtils]: Spent 26.70s on a formula simplification. DAG size of input: 115 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:17:59,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:18:02,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:18:05,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:18:07,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:18:10,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 13:18:12,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:19:05,938 WARN L233 SmtUtils]: Spent 49.51s on a formula simplification. DAG size of input: 133 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:19:10,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:19:12,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:19:16,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:19:30,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:19:32,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:19:37,736 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse33 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse64 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse33)) (.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse62 (let ((.cse65 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse33))) (store .cse18 .cse65 (bvadd (_ bv2 32) (select .cse18 .cse65))))) (.cse63 (select .cse18 .cse64))) (let ((.cse14 (store .cse62 .cse64 (bvadd (_ bv2 32) .cse63))) (.cse17 (not (= .cse63 (_ bv1 32)))) (.cse19 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse16 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse0 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv3 32)))) (.cse7 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse9 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse15 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse51 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (or (= .cse0 (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (let ((.cse12 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (bvadd ((_ sign_extend 32) (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse12 .cse6) (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse11 ((_ extract 31 0) .cse13)) (.cse10 ((_ extract 63 32) .cse13))) (let ((.cse5 (store (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse11) .cse6 .cse10))) (let ((.cse8 (bvadd ((_ sign_extend 32) (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (concat .cse10 .cse11)))) (let ((.cse3 ((_ extract 31 0) .cse8)) (.cse2 ((_ extract 63 32) .cse8))) (bvadd (concat .cse2 .cse3) ((_ sign_extend 32) (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse3) .cse6 .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))))))))) (concat ((_ extract 63 32) .cse1) ((_ extract 31 0) .cse1)))) .cse15 .cse16 .cse17) (not (bvslt (_ bv3 32) c_~N~0)) (= (select .cse18 .cse7) (_ bv3 32)) (let ((.cse32 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse33))) (let ((.cse20 (select .cse18 .cse32))) (or .cse19 .cse15 (not (= .cse20 (_ bv1 32))) (= (let ((.cse21 (let ((.cse31 (store .cse14 .cse32 (bvadd (_ bv2 32) .cse20)))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse31))) (let ((.cse29 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse30 (bvadd (concat (select .cse29 .cse6) (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse28 ((_ extract 31 0) .cse30)) (.cse27 ((_ extract 63 32) .cse30))) (let ((.cse25 (store (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse28) .cse6 .cse27))) (let ((.cse26 (bvadd ((_ sign_extend 32) (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse25) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (concat .cse27 .cse28)))) (let ((.cse23 ((_ extract 31 0) .cse26)) (.cse22 ((_ extract 63 32) .cse26))) (bvadd (concat .cse22 .cse23) ((_ sign_extend 32) (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse23) .cse6 .cse22)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))))))))) (concat ((_ extract 63 32) .cse21) ((_ extract 31 0) .cse21))) .cse0) .cse16 .cse17))) (not (bvsle c_~N~0 (_ bv0 32))) (= (_ bv3 32) (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)) (bvslt (_ bv2 32) c_~N~0) (or .cse19 (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32))) (let ((.cse48 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset| .cse33)) (.cse50 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset| .cse33)) (.cse47 (bvadd |ULTIMATE.start_main_~a~0#1.offset| .cse33))) (let ((.cse34 (select .cse18 .cse47)) (.cse35 (select .cse18 .cse50)) (.cse49 (select .cse18 .cse48))) (or (not (= .cse34 (_ bv1 32))) (not (= .cse35 (_ bv1 32))) (= .cse0 (let ((.cse36 (let ((.cse46 (store (store (store .cse18 .cse47 (bvadd (_ bv2 32) .cse34)) .cse48 (bvadd (_ bv2 32) .cse49)) .cse50 (bvadd (_ bv2 32) .cse35)))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46))) (let ((.cse44 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (bvadd ((_ sign_extend 32) (select .cse46 |ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse44 .cse6) (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse43 ((_ extract 31 0) .cse45)) (.cse42 ((_ extract 63 32) .cse45))) (let ((.cse40 (store (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse43) .cse6 .cse42))) (let ((.cse41 (bvadd ((_ sign_extend 32) (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse40) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|))) (concat .cse42 .cse43)))) (let ((.cse38 ((_ extract 31 0) .cse41)) (.cse37 ((_ extract 63 32) .cse41))) (bvadd (concat .cse37 .cse38) ((_ sign_extend 32) (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse38) .cse6 .cse37)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))))))))))))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36)))) (not (= .cse49 (_ bv1 32))))))) .cse16) (= (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) (= (_ bv3 32) (select .cse18 .cse9)) (= ((_ extract 31 0) (_ bv0 64)) (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (bvule c_~N~0 (_ bv536870911 32)) (or (= .cse0 (let ((.cse52 (let ((.cse55 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse62))) (let ((.cse60 (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse61 (bvadd (concat (select .cse60 .cse6) (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse62 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse59 ((_ extract 31 0) .cse61)) (.cse58 ((_ extract 63 32) .cse61))) (let ((.cse56 (store (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse59) .cse6 .cse58))) (let ((.cse57 (bvadd ((_ sign_extend 32) (select (select (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse56) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (concat .cse58 .cse59)))) (let ((.cse54 ((_ extract 31 0) .cse57)) (.cse53 ((_ extract 63 32) .cse57))) (bvadd (concat .cse53 .cse54) ((_ sign_extend 32) (select (select (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse54) .cse6 .cse53)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))))))))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52)))) .cse15) (= (select .cse51 .cse6) ((_ extract 63 32) (_ bv0 64)))))))) is different from true [2022-12-13 13:19:41,336 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse77 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse94 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| .cse77)) (.cse72 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse92 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32) .cse77))) (let ((.cse79 (select .cse72 .cse92)) (.cse90 (select .cse72 .cse94))) (let ((.cse21 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32) .cse77)) (.cse56 (store .cse72 .cse94 (bvadd (_ bv2 32) .cse90))) (.cse93 (bvadd (_ bv2 32) .cse79))) (let ((.cse23 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv3 32)))) (.cse12 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32))) (.cse14 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (.cse11 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse20 (store .cse56 .cse92 .cse93)) (.cse91 (select .cse72 .cse21))) (let ((.cse1 (not (= (_ bv1 32) |c_ULTIMATE.start_main_#t~mem8#1|))) (.cse34 (store .cse72 .cse92 .cse93)) (.cse22 (bvadd (_ bv2 32) .cse91)) (.cse5 (not (= .cse91 (_ bv1 32)))) (.cse4 (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse57 (not (= .cse90 (_ bv1 32)))) (.cse0 (= .cse23 (let ((.cse80 (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse20))) (let ((.cse88 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse89 (bvadd ((_ sign_extend 32) (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse88 .cse11) (select .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse87 ((_ extract 31 0) .cse89)) (.cse86 ((_ extract 63 32) .cse89))) (let ((.cse84 (store (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse87) .cse11 .cse86))) (let ((.cse85 (bvadd ((_ sign_extend 32) (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse84) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (concat .cse86 .cse87)))) (let ((.cse82 ((_ extract 31 0) .cse85)) (.cse81 ((_ extract 63 32) .cse85))) (bvadd (concat .cse81 .cse82) ((_ sign_extend 32) (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse82) .cse11 .cse81)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))))))))))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))))) (.cse58 (not (bvslt |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse2 (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse3 (not (= .cse79 (_ bv1 32)))) (.cse78 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (and (or .cse0 .cse1 .cse2 .cse3) (not (bvslt (_ bv3 32) c_~N~0)) (or .cse4 .cse1 .cse5 (= (let ((.cse6 (let ((.cse19 (store .cse20 .cse21 .cse22))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19))) (let ((.cse17 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (bvadd (concat (select .cse17 .cse11) (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse16 ((_ extract 31 0) .cse18)) (.cse15 ((_ extract 63 32) .cse18))) (let ((.cse10 (store (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse16) .cse11 .cse15))) (let ((.cse13 (bvadd ((_ sign_extend 32) (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse10) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (concat .cse15 .cse16)))) (let ((.cse8 ((_ extract 31 0) .cse13)) (.cse7 ((_ extract 63 32) .cse13))) (bvadd (concat .cse7 .cse8) ((_ sign_extend 32) (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8) .cse11 .cse7)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))))))))))))) (concat ((_ extract 63 32) .cse6) ((_ extract 31 0) .cse6))) .cse23) .cse2 .cse3) (or (= .cse23 (let ((.cse24 (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse34))) (let ((.cse32 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (bvadd (concat (select .cse32 .cse11) (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse31 ((_ extract 31 0) .cse33)) (.cse30 ((_ extract 63 32) .cse33))) (let ((.cse28 (store (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31) .cse11 .cse30))) (let ((.cse29 (bvadd ((_ sign_extend 32) (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse28) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (concat .cse30 .cse31)))) (let ((.cse26 ((_ extract 31 0) .cse29)) (.cse25 ((_ extract 63 32) .cse29))) (bvadd (concat .cse25 .cse26) ((_ sign_extend 32) (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse26) .cse11 .cse25)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))))))))))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24)))) .cse2 .cse3) (not (bvsle c_~N~0 (_ bv0 32))) (or (= .cse23 (let ((.cse35 (let ((.cse45 (store .cse34 .cse21 .cse22))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45))) (let ((.cse43 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (bvadd (concat (select .cse43 .cse11) (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse42 ((_ extract 31 0) .cse44)) (.cse41 ((_ extract 63 32) .cse44))) (let ((.cse37 (store (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse42) .cse11 .cse41))) (let ((.cse40 (bvadd ((_ sign_extend 32) (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse37) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (concat .cse41 .cse42)))) (let ((.cse39 ((_ extract 63 32) .cse40)) (.cse38 ((_ extract 31 0) .cse40))) (bvadd ((_ sign_extend 32) (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse38) .cse11 .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (concat .cse39 .cse38)))))))))))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35)))) .cse4 .cse5 .cse2 .cse3) (or (= .cse23 (let ((.cse46 (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse56))) (let ((.cse54 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse55 (bvadd (concat (select .cse54 .cse11) (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) ((_ sign_extend 32) (select .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse53 ((_ extract 31 0) .cse55)) (.cse52 ((_ extract 63 32) .cse55))) (let ((.cse50 (store (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse53) .cse11 .cse52))) (let ((.cse51 (bvadd ((_ sign_extend 32) (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse50) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) (concat .cse52 .cse53)))) (let ((.cse48 ((_ extract 31 0) .cse51)) (.cse47 ((_ extract 63 32) .cse51))) (bvadd (concat .cse47 .cse48) ((_ sign_extend 32) (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse48) .cse11 .cse47)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))))))))))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46)))) .cse57 .cse58) (or .cse4 (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32))) (let ((.cse74 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset| .cse77)) (.cse76 (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset| .cse77)) (.cse73 (bvadd |ULTIMATE.start_main_~a~0#1.offset| .cse77))) (let ((.cse59 (select .cse72 .cse73)) (.cse60 (select .cse72 .cse76)) (.cse75 (select .cse72 .cse74))) (or (not (= .cse59 (_ bv1 32))) (not (= .cse60 (_ bv1 32))) (= .cse23 (let ((.cse61 (let ((.cse71 (store (store (store .cse72 .cse73 (bvadd (_ bv2 32) .cse59)) .cse74 (bvadd (_ bv2 32) .cse75)) .cse76 (bvadd (_ bv2 32) .cse60)))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse71))) (let ((.cse69 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse70 (bvadd ((_ sign_extend 32) (select .cse71 |ULTIMATE.start_main_~a~0#1.offset|)) (concat (select .cse69 .cse11) (select .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse68 ((_ extract 31 0) .cse70)) (.cse67 ((_ extract 63 32) .cse70))) (let ((.cse65 (store (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse68) .cse11 .cse67))) (let ((.cse66 (bvadd ((_ sign_extend 32) (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse65) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|))) (concat .cse67 .cse68)))) (let ((.cse63 ((_ extract 31 0) .cse66)) (.cse62 ((_ extract 63 32) .cse66))) (bvadd (concat .cse62 .cse63) ((_ sign_extend 32) (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse63) .cse11 .cse62)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~a~0#1.offset|)))))))))))))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61)))) (not (= .cse75 (_ bv1 32))))))) .cse2) (= (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) (= ((_ extract 31 0) (_ bv0 64)) (select .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (bvule c_~N~0 (_ bv536870911 32)) (or .cse57 .cse0 .cse58 .cse2 .cse3) (= (select .cse78 .cse11) ((_ extract 63 32) (_ bv0 64)))))))))) is different from true [2022-12-13 13:19:43,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1]