./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/mods.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/mods.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:49:56,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:49:56,936 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:49:56,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:49:56,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:49:56,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:49:56,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:49:56,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:49:56,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:49:56,966 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:49:56,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:49:56,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:49:56,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:49:56,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:49:56,968 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:49:56,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:49:56,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:49:56,970 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:49:56,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:49:56,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:49:56,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:49:56,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:49:56,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:49:56,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:49:56,973 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:49:56,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:49:56,973 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:49:56,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:49:56,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:49:56,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:49:56,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:49:56,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:49:56,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:49:56,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:49:56,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:49:56,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:49:56,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:49:56,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:49:56,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:49:56,977 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:49:56,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:49:56,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:49:56,977 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/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_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba [2023-11-29 00:49:57,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:49:57,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:49:57,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:49:57,222 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:49:57,222 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:49:57,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/array-fpi/mods.c [2023-11-29 00:49:59,964 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:50:00,134 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:50:00,134 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/sv-benchmarks/c/array-fpi/mods.c [2023-11-29 00:50:00,142 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/data/4377d4112/c7920e18f24841bdbf7ba8da1c30496a/FLAG1e1a7f703 [2023-11-29 00:50:00,174 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/data/4377d4112/c7920e18f24841bdbf7ba8da1c30496a [2023-11-29 00:50:00,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:50:00,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:50:00,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:50:00,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:50:00,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:50:00,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:50:00" (1/1) ... [2023-11-29 00:50:00,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489ac6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:00, skipping insertion in model container [2023-11-29 00:50:00,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:50:00" (1/1) ... [2023-11-29 00:50:00,210 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:50:00,335 WARN L240 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_643521eb-11dd-4021-923c-43d6f2190f44/sv-benchmarks/c/array-fpi/mods.c[587,600] [2023-11-29 00:50:00,356 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:50:00,367 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:50:00,378 WARN L240 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_643521eb-11dd-4021-923c-43d6f2190f44/sv-benchmarks/c/array-fpi/mods.c[587,600] [2023-11-29 00:50:00,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:50:00,400 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:50:00,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:00 WrapperNode [2023-11-29 00:50:00,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:50:00,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:50:00,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:50:00,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:50:00,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:00" (1/1) ... [2023-11-29 00:50:00,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:00" (1/1) ... [2023-11-29 00:50:00,438 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2023-11-29 00:50:00,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:50:00,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:50:00,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:50:00,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:50:00,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:00" (1/1) ... [2023-11-29 00:50:00,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:00" (1/1) ... [2023-11-29 00:50:00,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:00" (1/1) ... [2023-11-29 00:50:00,464 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 7, 7, 5]. 33 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 5 writes are split as follows [0, 0, 3, 2]. [2023-11-29 00:50:00,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:00" (1/1) ... [2023-11-29 00:50:00,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:00" (1/1) ... [2023-11-29 00:50:00,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:00" (1/1) ... [2023-11-29 00:50:00,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:00" (1/1) ... [2023-11-29 00:50:00,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:00" (1/1) ... [2023-11-29 00:50:00,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:00" (1/1) ... [2023-11-29 00:50:00,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:50:00,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:50:00,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:50:00,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:50:00,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:00" (1/1) ... [2023-11-29 00:50:00,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:50:00,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:50:00,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:50:00,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:50:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:50:00,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:50:00,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:50:00,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:50:00,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:50:00,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:50:00,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:50:00,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:50:00,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:50:00,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:50:00,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:50:00,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:50:00,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:50:00,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:50:00,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:50:00,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 00:50:00,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 00:50:00,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:50:00,637 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:50:00,638 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:50:00,780 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:50:00,809 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:50:00,809 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 00:50:00,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:50:00 BoogieIcfgContainer [2023-11-29 00:50:00,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:50:00,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:50:00,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:50:00,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:50:00,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:50:00" (1/3) ... [2023-11-29 00:50:00,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cde3392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:50:00, skipping insertion in model container [2023-11-29 00:50:00,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:00" (2/3) ... [2023-11-29 00:50:00,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cde3392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:50:00, skipping insertion in model container [2023-11-29 00:50:00,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:50:00" (3/3) ... [2023-11-29 00:50:00,819 INFO L112 eAbstractionObserver]: Analyzing ICFG mods.c [2023-11-29 00:50:00,836 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:50:00,836 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:50:00,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:50:00,882 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7a6a7b9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:50:00,883 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:50:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 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) [2023-11-29 00:50:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:50:00,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:50:00,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:50:00,894 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:50:00,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:50:00,900 INFO L85 PathProgramCache]: Analyzing trace with hash -270928915, now seen corresponding path program 1 times [2023-11-29 00:50:00,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:50:00,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081165798] [2023-11-29 00:50:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:50:00,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:50:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:50:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:50:01,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:50:01,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081165798] [2023-11-29 00:50:01,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081165798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:50:01,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:50:01,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:50:01,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597055986] [2023-11-29 00:50:01,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:50:01,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:50:01,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:50:01,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:50:01,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:50:01,123 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 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) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:01,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:50:01,159 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2023-11-29 00:50:01,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:50:01,162 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2023-11-29 00:50:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:50:01,170 INFO L225 Difference]: With dead ends: 37 [2023-11-29 00:50:01,170 INFO L226 Difference]: Without dead ends: 17 [2023-11-29 00:50:01,173 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 [2023-11-29 00:50:01,177 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:50:01,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:50:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-29 00:50:01,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-29 00:50:01,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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) [2023-11-29 00:50:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-29 00:50:01,214 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 15 [2023-11-29 00:50:01,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:50:01,215 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-29 00:50:01,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:01,215 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-11-29 00:50:01,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:50:01,216 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:50:01,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:50:01,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:50:01,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:50:01,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:50:01,218 INFO L85 PathProgramCache]: Analyzing trace with hash -863276055, now seen corresponding path program 1 times [2023-11-29 00:50:01,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:50:01,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861611770] [2023-11-29 00:50:01,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:50:01,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:50:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:50:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:50:01,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:50:01,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861611770] [2023-11-29 00:50:01,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861611770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:50:01,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:50:01,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:50:01,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781176607] [2023-11-29 00:50:01,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:50:01,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:50:01,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:50:01,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:50:01,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:50:01,360 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:50:01,481 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-11-29 00:50:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:50:01,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2023-11-29 00:50:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:50:01,482 INFO L225 Difference]: With dead ends: 38 [2023-11-29 00:50:01,482 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 00:50:01,483 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 [2023-11-29 00:50:01,484 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:50:01,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 13 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:50:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 00:50:01,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2023-11-29 00:50:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:01,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-29 00:50:01,493 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2023-11-29 00:50:01,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:50:01,493 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-29 00:50:01,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:01,494 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-29 00:50:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 00:50:01,495 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:50:01,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:50:01,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:50:01,495 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:50:01,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:50:01,496 INFO L85 PathProgramCache]: Analyzing trace with hash 405160390, now seen corresponding path program 1 times [2023-11-29 00:50:01,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:50:01,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390392452] [2023-11-29 00:50:01,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:50:01,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:50:01,524 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:50:01,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1052049415] [2023-11-29 00:50:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:50:01,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:50:01,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:50:01,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:50:01,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:50:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:50:01,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 00:50:01,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:50:01,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:50:01,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:50:01,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:50:01,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:50:01,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:50:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:50:02,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:50:02,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-11-29 00:50:02,557 INFO L378 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 51 treesize of output 47 [2023-11-29 00:50:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:50:02,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:50:02,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390392452] [2023-11-29 00:50:02,695 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:50:02,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052049415] [2023-11-29 00:50:02,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052049415] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:50:02,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:50:02,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2023-11-29 00:50:02,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148511669] [2023-11-29 00:50:02,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:50:02,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 00:50:02,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:50:02,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 00:50:02,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2023-11-29 00:50:02,699 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:50:03,571 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2023-11-29 00:50:03,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 00:50:03,571 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 00:50:03,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:50:03,572 INFO L225 Difference]: With dead ends: 48 [2023-11-29 00:50:03,573 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 00:50:03,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2023-11-29 00:50:03,575 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 51 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:50:03,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 148 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:50:03,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 00:50:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2023-11-29 00:50:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 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) [2023-11-29 00:50:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2023-11-29 00:50:03,586 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 19 [2023-11-29 00:50:03,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:50:03,586 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-11-29 00:50:03,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:03,587 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2023-11-29 00:50:03,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 00:50:03,588 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:50:03,588 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:50:03,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:50:03,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:50:03,789 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:50:03,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:50:03,789 INFO L85 PathProgramCache]: Analyzing trace with hash 316854210, now seen corresponding path program 2 times [2023-11-29 00:50:03,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:50:03,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100870615] [2023-11-29 00:50:03,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:50:03,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:50:03,809 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:50:03,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482858698] [2023-11-29 00:50:03,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:50:03,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:50:03,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:50:03,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:50:03,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:50:03,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:50:03,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:50:03,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:50:03,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:50:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:50:03,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:50:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:50:04,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:50:04,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100870615] [2023-11-29 00:50:04,007 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:50:04,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482858698] [2023-11-29 00:50:04,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482858698] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:50:04,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:50:04,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-11-29 00:50:04,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570119597] [2023-11-29 00:50:04,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:50:04,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:50:04,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:50:04,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:50:04,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:50:04,010 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:50:04,169 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2023-11-29 00:50:04,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:50:04,170 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 [2023-11-29 00:50:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:50:04,171 INFO L225 Difference]: With dead ends: 79 [2023-11-29 00:50:04,171 INFO L226 Difference]: Without dead ends: 44 [2023-11-29 00:50:04,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:50:04,173 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:50:04,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 38 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:50:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-29 00:50:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2023-11-29 00:50:04,181 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) [2023-11-29 00:50:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-29 00:50:04,182 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2023-11-29 00:50:04,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:50:04,182 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-29 00:50:04,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-11-29 00:50:04,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 00:50:04,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:50:04,184 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:50:04,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:50:04,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:50:04,385 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:50:04,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:50:04,385 INFO L85 PathProgramCache]: Analyzing trace with hash -732578568, now seen corresponding path program 3 times [2023-11-29 00:50:04,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:50:04,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317763173] [2023-11-29 00:50:04,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:50:04,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:50:04,405 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:50:04,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [547944508] [2023-11-29 00:50:04,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:50:04,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:50:04,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:50:04,407 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:50:04,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:50:04,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 00:50:04,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:50:04,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:50:04,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:50:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:50:04,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:50:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:50:04,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:50:04,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317763173] [2023-11-29 00:50:04,561 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:50:04,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547944508] [2023-11-29 00:50:04,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547944508] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:50:04,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:50:04,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-11-29 00:50:04,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788904278] [2023-11-29 00:50:04,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:50:04,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:50:04,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:50:04,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:50:04,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:50:04,564 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:50:04,677 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2023-11-29 00:50:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:50:04,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 00:50:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:50:04,678 INFO L225 Difference]: With dead ends: 43 [2023-11-29 00:50:04,678 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 00:50:04,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:50:04,680 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 47 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:50:04,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 30 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:50:04,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 00:50:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2023-11-29 00:50:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-11-29 00:50:04,686 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 21 [2023-11-29 00:50:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:50:04,686 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-29 00:50:04,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:50:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-11-29 00:50:04,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 00:50:04,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:50:04,687 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:50:04,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 00:50:04,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:50:04,892 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:50:04,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:50:04,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1546241993, now seen corresponding path program 4 times [2023-11-29 00:50:04,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:50:04,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679480442] [2023-11-29 00:50:04,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:50:04,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:50:04,915 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:50:04,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [18800199] [2023-11-29 00:50:04,916 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:50:04,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:50:04,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:50:04,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:50:04,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:50:05,035 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:50:05,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:50:05,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-29 00:50:05,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:50:05,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:50:05,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 00:50:05,145 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-29 00:50:05,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2023-11-29 00:50:05,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-29 00:50:05,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2023-11-29 00:50:05,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:50:05,854 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:50:05,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:05,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 58 [2023-11-29 00:50:05,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:05,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 42 [2023-11-29 00:50:06,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 602 treesize of output 528 [2023-11-29 00:50:06,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 528 treesize of output 475 [2023-11-29 00:50:06,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:50:06,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:50:06,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2023-11-29 00:50:06,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 349 treesize of output 261 [2023-11-29 00:50:06,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 219 [2023-11-29 00:50:06,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 206 [2023-11-29 00:50:06,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:50:06,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2023-11-29 00:50:06,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 31 [2023-11-29 00:50:06,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:50:06,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2023-11-29 00:50:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:50:06,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:50:12,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2023-11-29 00:50:12,660 INFO L378 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 248 treesize of output 240 [2023-11-29 00:50:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:50:20,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:50:20,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679480442] [2023-11-29 00:50:20,882 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:50:20,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18800199] [2023-11-29 00:50:20,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18800199] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:50:20,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:50:20,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-11-29 00:50:20,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602290145] [2023-11-29 00:50:20,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:50:20,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 00:50:20,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:50:20,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 00:50:20,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=960, Unknown=3, NotChecked=0, Total=1122 [2023-11-29 00:50:20,886 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:51:14,598 WARN L293 SmtUtils]: Spent 15.82s on a formula simplification. DAG size of input: 77 DAG size of output: 65 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:51:18,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 00:51:22,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 00:51:35,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 00:51:39,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 00:51:58,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 00:52:14,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 00:52:23,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 00:52:28,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 00:52:55,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 00:53:19,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 00:53:21,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2023-11-29 00:53:25,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2023-11-29 00:53:31,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 00:53:43,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 00:53:48,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 00:53:55,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 00:54:00,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:00,874 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2023-11-29 00:54:00,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-11-29 00:54:00,874 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-29 00:54:00,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:00,875 INFO L225 Difference]: With dead ends: 109 [2023-11-29 00:54:00,875 INFO L226 Difference]: Without dead ends: 107 [2023-11-29 00:54:00,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2199 ImplicationChecksByTransitivity, 168.0s TimeCoverageRelationStatistics Valid=1095, Invalid=7633, Unknown=14, NotChecked=0, Total=8742 [2023-11-29 00:54:00,879 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 205 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 138 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:00,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 156 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 427 Invalid, 13 Unknown, 0 Unchecked, 66.2s Time] [2023-11-29 00:54:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-29 00:54:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 58. [2023-11-29 00:54:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2023-11-29 00:54:00,894 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 23 [2023-11-29 00:54:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:00,895 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2023-11-29 00:54:00,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2023-11-29 00:54:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 00:54:00,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:00,896 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:00,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 00:54:01,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 00:54:01,096 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:54:01,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1281102295, now seen corresponding path program 5 times [2023-11-29 00:54:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:54:01,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043068347] [2023-11-29 00:54:01,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:01,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:54:01,113 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:54:01,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [252063525] [2023-11-29 00:54:01,114 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:54:01,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:54:01,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:54:01,115 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:54:01,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:54:01,256 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-29 00:54:01,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:54:01,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:54:01,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 00:54:01,314 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:54:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 00:54:01,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:54:01,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043068347] [2023-11-29 00:54:01,360 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:54:01,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252063525] [2023-11-29 00:54:01,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252063525] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:54:01,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:54:01,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-11-29 00:54:01,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229870340] [2023-11-29 00:54:01,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:54:01,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 00:54:01,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:54:01,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:54:01,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:54:01,362 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:01,575 INFO L93 Difference]: Finished difference Result 116 states and 144 transitions. [2023-11-29 00:54:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:54:01,575 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 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 25 [2023-11-29 00:54:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:01,577 INFO L225 Difference]: With dead ends: 116 [2023-11-29 00:54:01,577 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 00:54:01,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2023-11-29 00:54:01,578 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:01,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 71 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:54:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 00:54:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 57. [2023-11-29 00:54:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.25) internal successors, (70), 56 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) [2023-11-29 00:54:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2023-11-29 00:54:01,599 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 25 [2023-11-29 00:54:01,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:01,600 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2023-11-29 00:54:01,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2023-11-29 00:54:01,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 00:54:01,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:01,601 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:01,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 00:54:01,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:54:01,808 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:54:01,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:01,808 INFO L85 PathProgramCache]: Analyzing trace with hash 576105885, now seen corresponding path program 1 times [2023-11-29 00:54:01,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:54:01,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032029247] [2023-11-29 00:54:01,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:01,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:54:01,822 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:54:01,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700355726] [2023-11-29 00:54:01,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:01,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:54:01,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:54:01,824 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:54:01,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 00:54:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:01,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 00:54:01,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:01,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:54:01,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:54:01,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 00:54:02,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:54:02,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:54:02,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:54:02,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 00:54:02,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:54:02,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 00:54:02,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:54:02,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 00:54:02,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:54:02,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2023-11-29 00:54:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:02,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:54:04,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 190 [2023-11-29 00:54:04,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:54:04,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1034 treesize of output 938 [2023-11-29 00:54:13,306 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (forall ((v_arrayElimCell_44 Int)) (let ((.cse1 (+ .cse0 2 v_arrayElimCell_44))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_44) 1) .cse1) 0)) (= (mod .cse1 .cse1) 0)))) (not .cse2)) (or (= |c_ULTIMATE.start_main_~i~0#1| 0) (let ((.cse7 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0))) (let ((.cse4 (not .cse7))) (and (or (forall ((v_arrayElimCell_43 Int)) (let ((.cse3 (+ .cse0 2 v_arrayElimCell_43))) (or (= (mod (+ .cse0 (* 2 v_arrayElimCell_43) 1) .cse3) 0) (not (= (mod .cse3 .cse3) 0))))) .cse4) (or (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse6 (* 2 v_arrayElimCell_43)) (.cse5 (+ .cse0 v_arrayElimCell_44 v_arrayElimCell_43 1))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_44) v_arrayElimCell_43) .cse5) 0)) (= (mod (+ .cse0 .cse6 1) (+ .cse0 2 v_arrayElimCell_43)) 0) (= (mod (+ .cse0 .cse6 v_arrayElimCell_44) .cse5) 0)))) .cse7) (or .cse4 (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse8 (* 2 v_arrayElimCell_43)) (.cse9 (+ .cse0 2 v_arrayElimCell_43))) (or (= (mod (+ .cse0 .cse8 1) .cse9) 0) (= (mod (+ .cse0 .cse8 v_arrayElimCell_44) (+ .cse0 v_arrayElimCell_44 v_arrayElimCell_43 1)) 0) (not (= (mod .cse9 .cse9) 0)))))) (or (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse10 (+ .cse0 v_arrayElimCell_44 v_arrayElimCell_43 1))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_44) v_arrayElimCell_43) .cse10) 0)) (= (mod (+ .cse0 (* 2 v_arrayElimCell_43) v_arrayElimCell_44) .cse10) 0)))) .cse7)))) .cse2))) is different from false [2023-11-29 00:54:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 00:54:13,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:54:13,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032029247] [2023-11-29 00:54:13,356 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:54:13,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700355726] [2023-11-29 00:54:13,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700355726] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:54:13,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:54:13,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2023-11-29 00:54:13,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645430537] [2023-11-29 00:54:13,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:54:13,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 00:54:13,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:54:13,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 00:54:13,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=907, Unknown=1, NotChecked=64, Total=1190 [2023-11-29 00:54:13,359 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 35 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:52,199 WARN L293 SmtUtils]: Spent 26.45s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:54:54,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:54:56,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:54:58,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:55:02,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:55:05,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:55:09,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:55:16,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:55:19,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:55:30,013 WARN L293 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:55:35,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:55:45,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:55:48,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:55:53,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:55:55,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:56:00,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:56:07,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:56:09,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:56:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:56:15,609 INFO L93 Difference]: Finished difference Result 144 states and 174 transitions. [2023-11-29 00:56:15,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-29 00:56:15,609 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 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 26 [2023-11-29 00:56:15,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:56:15,611 INFO L225 Difference]: With dead ends: 144 [2023-11-29 00:56:15,611 INFO L226 Difference]: Without dead ends: 142 [2023-11-29 00:56:15,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 72.9s TimeCoverageRelationStatistics Valid=804, Invalid=4169, Unknown=1, NotChecked=138, Total=5112 [2023-11-29 00:56:15,613 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 206 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 71 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 55.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:56:15,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 161 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 528 Invalid, 7 Unknown, 119 Unchecked, 55.7s Time] [2023-11-29 00:56:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-29 00:56:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 76. [2023-11-29 00:56:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 75 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:56:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2023-11-29 00:56:15,649 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 26 [2023-11-29 00:56:15,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:56:15,649 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2023-11-29 00:56:15,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:56:15,649 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2023-11-29 00:56:15,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 00:56:15,651 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:56:15,651 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:56:15,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 00:56:15,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:56:15,851 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:56:15,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:56:15,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1860520432, now seen corresponding path program 6 times [2023-11-29 00:56:15,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:56:15,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501372198] [2023-11-29 00:56:15,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:56:15,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:56:15,870 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:56:15,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [542239409] [2023-11-29 00:56:15,871 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 00:56:15,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:56:15,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:56:15,872 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:56:15,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:56:15,966 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-29 00:56:15,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:56:15,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:56:15,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:56:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 00:56:16,025 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:56:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 00:56:16,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:56:16,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501372198] [2023-11-29 00:56:16,073 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:56:16,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542239409] [2023-11-29 00:56:16,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542239409] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:56:16,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:56:16,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-11-29 00:56:16,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855937989] [2023-11-29 00:56:16,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:56:16,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 00:56:16,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:56:16,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:56:16,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:56:16,075 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:56:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:56:16,231 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2023-11-29 00:56:16,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:56:16,232 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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 26 [2023-11-29 00:56:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:56:16,232 INFO L225 Difference]: With dead ends: 116 [2023-11-29 00:56:16,233 INFO L226 Difference]: Without dead ends: 44 [2023-11-29 00:56:16,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-11-29 00:56:16,234 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:56:16,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 49 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:56:16,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-29 00:56:16,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 29. [2023-11-29 00:56:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:56:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-11-29 00:56:16,249 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 26 [2023-11-29 00:56:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:56:16,249 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-11-29 00:56:16,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:56:16,249 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-11-29 00:56:16,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 00:56:16,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:56:16,250 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:56:16,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 00:56:16,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:56:16,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:56:16,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:56:16,451 INFO L85 PathProgramCache]: Analyzing trace with hash 444924774, now seen corresponding path program 7 times [2023-11-29 00:56:16,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:56:16,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304821529] [2023-11-29 00:56:16,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:56:16,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:56:16,468 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:56:16,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220180396] [2023-11-29 00:56:16,469 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 00:56:16,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:56:16,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:56:16,470 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:56:16,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 00:56:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:56:16,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 00:56:16,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:56:16,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:56:16,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:56:16,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 00:56:16,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:16,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 00:56:16,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:56:16,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:56:16,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 00:56:16,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:16,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 00:56:16,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:16,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 00:56:16,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:16,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 00:56:17,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:17,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 00:56:17,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:17,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 00:56:17,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:17,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 00:56:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:56:17,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:56:19,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 182 [2023-11-29 00:56:19,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:19,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16277 treesize of output 14997 [2023-11-29 00:56:25,081 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse15 (= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 0)) (.cse7 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0)) (.cse23 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse39 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse4 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_70 Int)) (let ((.cse56 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse4 .cse56 v_arrayElimCell_70 1) (+ .cse4 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (mod (+ .cse4 2 .cse56) (+ .cse4 3 v_arrayElimCell_72)) 0))))) (.cse3 (not .cse39)) (.cse1 (= 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse14 (not .cse23)) (.cse16 (forall ((v_arrayElimCell_71 Int)) (= (let ((.cse55 (+ .cse4 3 v_arrayElimCell_71))) (mod .cse55 .cse55)) 0))) (.cse8 (not .cse7)) (.cse0 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_70 Int)) (= (mod (+ .cse4 (* 2 v_arrayElimCell_72) v_arrayElimCell_70 1) (+ .cse4 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0))) (.cse13 (not .cse15)) (.cse22 (and (= (let ((.cse54 (+ .cse4 4))) (mod .cse54 .cse54)) 0) .cse23))) (and (or .cse0 (not .cse1)) (or .cse2 .cse3) (or (and (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (let ((.cse5 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse4 .cse5 v_arrayElimCell_70 1) (+ .cse4 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (mod (+ .cse4 .cse5 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse6 (+ .cse4 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse6 .cse6)) 0) (= (mod (+ .cse4 2 .cse5) (+ .cse4 3 v_arrayElimCell_72)) 0)))) .cse7) (or .cse8 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (let ((.cse9 (+ .cse4 3 v_arrayElimCell_71))) (mod .cse9 .cse9)) 0) (= (let ((.cse10 (+ .cse4 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse10 .cse10)) 0) (= (mod (+ .cse4 2 (* 2 v_arrayElimCell_72)) (+ .cse4 3 v_arrayElimCell_72)) 0)))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (let ((.cse11 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse4 .cse11 v_arrayElimCell_70 1) (+ .cse4 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (let ((.cse12 (+ .cse4 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse12 .cse12)) 0) (= (mod (+ .cse4 2 .cse11) (+ .cse4 3 v_arrayElimCell_72)) 0)))) .cse13) (or .cse14 .cse2) (or .cse15 (and (or .cse16 .cse8 .cse2) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (let ((.cse17 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse4 .cse17 v_arrayElimCell_70 1) (+ .cse4 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (mod (+ .cse4 .cse17 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (mod (+ .cse4 2 .cse17) (+ .cse4 3 v_arrayElimCell_72)) 0)))) .cse7) (forall ((v_arrayElimCell_72 Int)) (let ((.cse18 (* 2 v_arrayElimCell_72))) (or (forall ((v_arrayElimCell_70 Int)) (or (= (mod (+ .cse4 .cse18 v_arrayElimCell_70 1) (+ .cse4 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (forall ((v_arrayElimCell_71 Int)) (or (= (mod (+ .cse4 .cse18 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse19 (+ .cse4 3 v_arrayElimCell_71))) (mod .cse19 .cse19)) 0))))) (= (mod (+ .cse4 2 .cse18) (+ .cse4 3 v_arrayElimCell_72)) 0)))))) (forall ((v_arrayElimCell_72 Int)) (let ((.cse20 (* 2 v_arrayElimCell_72))) (or (forall ((v_arrayElimCell_70 Int)) (or (= (mod (+ .cse4 .cse20 v_arrayElimCell_70 1) (+ .cse4 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (forall ((v_arrayElimCell_71 Int)) (or (= (mod (+ .cse4 .cse20 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse21 (+ .cse4 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse21 .cse21)) 0))))) (= (mod (+ .cse4 2 .cse20) (+ .cse4 3 v_arrayElimCell_72)) 0))))) .cse22) (or (let ((.cse30 (forall ((v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (let ((.cse41 (+ .cse4 3 v_arrayElimCell_71))) (mod .cse41 .cse41)) 0) (= (let ((.cse42 (+ .cse4 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse42 .cse42)) 0)))) (.cse34 (forall ((v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (= (let ((.cse40 (+ .cse4 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse40 .cse40)) 0))) (.cse27 (forall ((v_arrayElimCell_72 Int)) (= (mod (+ .cse4 2 (* 2 v_arrayElimCell_72)) (+ .cse4 3 v_arrayElimCell_72)) 0)))) (and (or .cse23 (and (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (let ((.cse24 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse4 .cse24 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse25 (+ .cse4 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse25 .cse25)) 0) (= (mod (+ .cse4 2 .cse24) (+ .cse4 3 v_arrayElimCell_72)) 0)))) .cse7) (or .cse15 (and (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (let ((.cse26 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse4 .cse26 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (mod (+ .cse4 2 .cse26) (+ .cse4 3 v_arrayElimCell_72)) 0)))) .cse7) (or .cse16 .cse8 .cse27) (forall ((v_arrayElimCell_72 Int)) (let ((.cse28 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse4 2 .cse28) (+ .cse4 3 v_arrayElimCell_72)) 0) (forall ((v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (mod (+ .cse4 .cse28 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse29 (+ .cse4 3 v_arrayElimCell_71))) (mod .cse29 .cse29)) 0)))))))) (or .cse8 .cse27 .cse30) (forall ((v_arrayElimCell_72 Int)) (let ((.cse31 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse4 2 .cse31) (+ .cse4 3 v_arrayElimCell_72)) 0) (forall ((v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (mod (+ .cse4 .cse31 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse32 (+ .cse4 3 v_arrayElimCell_71))) (mod .cse32 .cse32)) 0) (= (let ((.cse33 (+ .cse4 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse33 .cse33)) 0)))))) (or .cse34 .cse27 .cse13))) (or (and (or .cse8 .cse30) (or (and (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (mod (+ .cse4 (* 2 v_arrayElimCell_72) v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse35 (+ .cse4 3 v_arrayElimCell_71))) (mod .cse35 .cse35)) 0))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (= (mod (+ .cse4 (* 2 v_arrayElimCell_72) v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0)) .cse7) (or .cse16 .cse8)) .cse15) .cse14 (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (mod (+ .cse4 (* 2 v_arrayElimCell_72) v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse36 (+ .cse4 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse36 .cse36)) 0))) .cse7) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (mod (+ .cse4 (* 2 v_arrayElimCell_72) v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse37 (+ .cse4 3 v_arrayElimCell_71))) (mod .cse37 .cse37)) 0) (= (let ((.cse38 (+ .cse4 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse38 .cse38)) 0))) (or .cse34 .cse13)) .cse22 .cse39) (or .cse27 .cse3))) .cse1) (or (and (or .cse0 .cse14) (or .cse8 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (mod (+ .cse4 (* 2 v_arrayElimCell_72) v_arrayElimCell_70 1) (+ .cse4 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (let ((.cse43 (+ .cse4 3 v_arrayElimCell_71))) (mod .cse43 .cse43)) 0) (= (let ((.cse44 (+ .cse4 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse44 .cse44)) 0)))) (or .cse15 (and (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_70 Int)) (let ((.cse45 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse4 .cse45 v_arrayElimCell_70 1) (+ .cse4 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (forall ((v_arrayElimCell_71 Int)) (or (= (mod (+ .cse4 .cse45 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse46 (+ .cse4 3 v_arrayElimCell_71))) (mod .cse46 .cse46)) 0)))))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (let ((.cse47 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse4 .cse47 v_arrayElimCell_70 1) (+ .cse4 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (mod (+ .cse4 .cse47 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0)))) .cse7) (or .cse16 .cse8 .cse0))) (or .cse7 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (let ((.cse48 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse4 .cse48 v_arrayElimCell_70 1) (+ .cse4 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (mod (+ .cse4 .cse48 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse49 (+ .cse4 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse49 .cse49)) 0))))) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_70 Int)) (let ((.cse50 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse4 .cse50 v_arrayElimCell_70 1) (+ .cse4 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (forall ((v_arrayElimCell_71 Int)) (or (= (mod (+ .cse4 .cse50 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse4 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse51 (+ .cse4 3 v_arrayElimCell_71))) (mod .cse51 .cse51)) 0) (= (let ((.cse52 (+ .cse4 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse52 .cse52)) 0)))))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (mod (+ .cse4 (* 2 v_arrayElimCell_72) v_arrayElimCell_70 1) (+ .cse4 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (let ((.cse53 (+ .cse4 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse53 .cse53)) 0))) .cse13)) .cse22 .cse39)))) is different from true [2023-11-29 00:56:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-29 00:56:25,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:56:25,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304821529] [2023-11-29 00:56:25,094 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:56:25,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220180396] [2023-11-29 00:56:25,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220180396] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:56:25,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:56:25,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 39 [2023-11-29 00:56:25,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049286958] [2023-11-29 00:56:25,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:56:25,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 00:56:25,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:56:25,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 00:56:25,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1226, Unknown=1, NotChecked=72, Total=1482 [2023-11-29 00:56:25,097 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 39 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 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) [2023-11-29 00:56:29,288 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse16 (= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 0)) (.cse8 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0)) (.cse4 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse39 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse5 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_70 Int)) (let ((.cse56 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse5 .cse56 v_arrayElimCell_70 1) (+ .cse5 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (mod (+ .cse5 2 .cse56) (+ .cse5 3 v_arrayElimCell_72)) 0))))) (.cse3 (not .cse39)) (.cse1 (= 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse15 (not .cse4)) (.cse17 (forall ((v_arrayElimCell_71 Int)) (= (let ((.cse55 (+ .cse5 3 v_arrayElimCell_71))) (mod .cse55 .cse55)) 0))) (.cse9 (not .cse8)) (.cse0 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_70 Int)) (= (mod (+ .cse5 (* 2 v_arrayElimCell_72) v_arrayElimCell_70 1) (+ .cse5 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0))) (.cse14 (not .cse16)) (.cse23 (and (= (let ((.cse54 (+ .cse5 4))) (mod .cse54 .cse54)) 0) .cse4))) (and (or .cse0 (not .cse1)) (or .cse2 .cse3) .cse4 (or (and (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (let ((.cse6 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse5 .cse6 v_arrayElimCell_70 1) (+ .cse5 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (mod (+ .cse5 .cse6 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse7 (+ .cse5 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse7 .cse7)) 0) (= (mod (+ .cse5 2 .cse6) (+ .cse5 3 v_arrayElimCell_72)) 0)))) .cse8) (or .cse9 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (let ((.cse10 (+ .cse5 3 v_arrayElimCell_71))) (mod .cse10 .cse10)) 0) (= (let ((.cse11 (+ .cse5 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse11 .cse11)) 0) (= (mod (+ .cse5 2 (* 2 v_arrayElimCell_72)) (+ .cse5 3 v_arrayElimCell_72)) 0)))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (let ((.cse12 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse5 .cse12 v_arrayElimCell_70 1) (+ .cse5 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (let ((.cse13 (+ .cse5 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse13 .cse13)) 0) (= (mod (+ .cse5 2 .cse12) (+ .cse5 3 v_arrayElimCell_72)) 0)))) .cse14) (or .cse15 .cse2) (or .cse16 (and (or .cse17 .cse9 .cse2) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (let ((.cse18 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse5 .cse18 v_arrayElimCell_70 1) (+ .cse5 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (mod (+ .cse5 .cse18 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (mod (+ .cse5 2 .cse18) (+ .cse5 3 v_arrayElimCell_72)) 0)))) .cse8) (forall ((v_arrayElimCell_72 Int)) (let ((.cse19 (* 2 v_arrayElimCell_72))) (or (forall ((v_arrayElimCell_70 Int)) (or (= (mod (+ .cse5 .cse19 v_arrayElimCell_70 1) (+ .cse5 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (forall ((v_arrayElimCell_71 Int)) (or (= (mod (+ .cse5 .cse19 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse20 (+ .cse5 3 v_arrayElimCell_71))) (mod .cse20 .cse20)) 0))))) (= (mod (+ .cse5 2 .cse19) (+ .cse5 3 v_arrayElimCell_72)) 0)))))) (forall ((v_arrayElimCell_72 Int)) (let ((.cse21 (* 2 v_arrayElimCell_72))) (or (forall ((v_arrayElimCell_70 Int)) (or (= (mod (+ .cse5 .cse21 v_arrayElimCell_70 1) (+ .cse5 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (forall ((v_arrayElimCell_71 Int)) (or (= (mod (+ .cse5 .cse21 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse22 (+ .cse5 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse22 .cse22)) 0))))) (= (mod (+ .cse5 2 .cse21) (+ .cse5 3 v_arrayElimCell_72)) 0))))) .cse23) (= .cse5 0) (or (let ((.cse30 (forall ((v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (let ((.cse41 (+ .cse5 3 v_arrayElimCell_71))) (mod .cse41 .cse41)) 0) (= (let ((.cse42 (+ .cse5 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse42 .cse42)) 0)))) (.cse34 (forall ((v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (= (let ((.cse40 (+ .cse5 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse40 .cse40)) 0))) (.cse27 (forall ((v_arrayElimCell_72 Int)) (= (mod (+ .cse5 2 (* 2 v_arrayElimCell_72)) (+ .cse5 3 v_arrayElimCell_72)) 0)))) (and (or .cse4 (and (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (let ((.cse24 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse5 .cse24 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse25 (+ .cse5 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse25 .cse25)) 0) (= (mod (+ .cse5 2 .cse24) (+ .cse5 3 v_arrayElimCell_72)) 0)))) .cse8) (or .cse16 (and (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (let ((.cse26 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse5 .cse26 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (mod (+ .cse5 2 .cse26) (+ .cse5 3 v_arrayElimCell_72)) 0)))) .cse8) (or .cse17 .cse9 .cse27) (forall ((v_arrayElimCell_72 Int)) (let ((.cse28 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse5 2 .cse28) (+ .cse5 3 v_arrayElimCell_72)) 0) (forall ((v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (mod (+ .cse5 .cse28 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse29 (+ .cse5 3 v_arrayElimCell_71))) (mod .cse29 .cse29)) 0)))))))) (or .cse9 .cse27 .cse30) (forall ((v_arrayElimCell_72 Int)) (let ((.cse31 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse5 2 .cse31) (+ .cse5 3 v_arrayElimCell_72)) 0) (forall ((v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (mod (+ .cse5 .cse31 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse32 (+ .cse5 3 v_arrayElimCell_71))) (mod .cse32 .cse32)) 0) (= (let ((.cse33 (+ .cse5 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse33 .cse33)) 0)))))) (or .cse34 .cse27 .cse14))) (or (and (or .cse9 .cse30) (or (and (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (mod (+ .cse5 (* 2 v_arrayElimCell_72) v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse35 (+ .cse5 3 v_arrayElimCell_71))) (mod .cse35 .cse35)) 0))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (= (mod (+ .cse5 (* 2 v_arrayElimCell_72) v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0)) .cse8) (or .cse17 .cse9)) .cse16) .cse15 (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (mod (+ .cse5 (* 2 v_arrayElimCell_72) v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse36 (+ .cse5 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse36 .cse36)) 0))) .cse8) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (mod (+ .cse5 (* 2 v_arrayElimCell_72) v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse37 (+ .cse5 3 v_arrayElimCell_71))) (mod .cse37 .cse37)) 0) (= (let ((.cse38 (+ .cse5 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse38 .cse38)) 0))) (or .cse34 .cse14)) .cse23 .cse39) (or .cse27 .cse3))) .cse1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (and (or .cse0 .cse15) (or .cse9 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (mod (+ .cse5 (* 2 v_arrayElimCell_72) v_arrayElimCell_70 1) (+ .cse5 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (let ((.cse43 (+ .cse5 3 v_arrayElimCell_71))) (mod .cse43 .cse43)) 0) (= (let ((.cse44 (+ .cse5 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse44 .cse44)) 0)))) (or .cse16 (and (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_70 Int)) (let ((.cse45 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse5 .cse45 v_arrayElimCell_70 1) (+ .cse5 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (forall ((v_arrayElimCell_71 Int)) (or (= (mod (+ .cse5 .cse45 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse46 (+ .cse5 3 v_arrayElimCell_71))) (mod .cse46 .cse46)) 0)))))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (let ((.cse47 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse5 .cse47 v_arrayElimCell_70 1) (+ .cse5 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (mod (+ .cse5 .cse47 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0)))) .cse8) (or .cse17 .cse9 .cse0))) (or .cse8 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (let ((.cse48 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse5 .cse48 v_arrayElimCell_70 1) (+ .cse5 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (mod (+ .cse5 .cse48 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse49 (+ .cse5 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse49 .cse49)) 0))))) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_70 Int)) (let ((.cse50 (* 2 v_arrayElimCell_72))) (or (= (mod (+ .cse5 .cse50 v_arrayElimCell_70 1) (+ .cse5 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (forall ((v_arrayElimCell_71 Int)) (or (= (mod (+ .cse5 .cse50 v_arrayElimCell_71 v_arrayElimCell_70) (+ .cse5 v_arrayElimCell_72 v_arrayElimCell_71 v_arrayElimCell_70 1)) 0) (= (let ((.cse51 (+ .cse5 3 v_arrayElimCell_71))) (mod .cse51 .cse51)) 0) (= (let ((.cse52 (+ .cse5 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse52 .cse52)) 0)))))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_arrayElimCell_70 Int)) (or (= (mod (+ .cse5 (* 2 v_arrayElimCell_72) v_arrayElimCell_70 1) (+ .cse5 2 v_arrayElimCell_72 v_arrayElimCell_70)) 0) (= (let ((.cse53 (+ .cse5 2 v_arrayElimCell_71 v_arrayElimCell_70))) (mod .cse53 .cse53)) 0))) .cse14)) .cse23 .cse39)))) is different from true [2023-11-29 00:56:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:56:35,369 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2023-11-29 00:56:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-29 00:56:35,370 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 00:56:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:56:35,371 INFO L225 Difference]: With dead ends: 91 [2023-11-29 00:56:35,371 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 00:56:35,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=488, Invalid=2940, Unknown=2, NotChecked=230, Total=3660 [2023-11-29 00:56:35,372 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 164 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:56:35,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 214 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 676 Invalid, 0 Unknown, 132 Unchecked, 1.8s Time] [2023-11-29 00:56:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 00:56:35,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2023-11-29 00:56:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:56:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2023-11-29 00:56:35,400 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 27 [2023-11-29 00:56:35,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:56:35,400 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2023-11-29 00:56:35,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 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) [2023-11-29 00:56:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2023-11-29 00:56:35,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 00:56:35,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:56:35,402 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:56:35,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 00:56:35,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:56:35,602 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:56:35,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:56:35,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1432300002, now seen corresponding path program 8 times [2023-11-29 00:56:35,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:56:35,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472399425] [2023-11-29 00:56:35,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:56:35,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:56:35,617 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:56:35,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1115551827] [2023-11-29 00:56:35,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:56:35,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:56:35,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:56:35,618 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:56:35,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 00:56:35,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:56:35,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:56:35,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 00:56:35,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:56:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:56:35,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:56:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:56:35,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:56:35,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472399425] [2023-11-29 00:56:35,817 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:56:35,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115551827] [2023-11-29 00:56:35,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115551827] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:56:35,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:56:35,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2023-11-29 00:56:35,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837496693] [2023-11-29 00:56:35,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:56:35,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 00:56:35,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:56:35,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 00:56:35,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:56:35,818 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:56:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:56:36,057 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2023-11-29 00:56:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:56:36,058 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 00:56:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:56:36,058 INFO L225 Difference]: With dead ends: 132 [2023-11-29 00:56:36,058 INFO L226 Difference]: Without dead ends: 96 [2023-11-29 00:56:36,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2023-11-29 00:56:36,059 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 86 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:56:36,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 68 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:56:36,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-29 00:56:36,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 68. [2023-11-29 00:56:36,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:56:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2023-11-29 00:56:36,092 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 28 [2023-11-29 00:56:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:56:36,092 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2023-11-29 00:56:36,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:56:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2023-11-29 00:56:36,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 00:56:36,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:56:36,093 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:56:36,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 00:56:36,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 00:56:36,293 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:56:36,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:56:36,294 INFO L85 PathProgramCache]: Analyzing trace with hash 637829400, now seen corresponding path program 9 times [2023-11-29 00:56:36,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:56:36,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962228974] [2023-11-29 00:56:36,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:56:36,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:56:36,312 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:56:36,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [737876396] [2023-11-29 00:56:36,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:56:36,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:56:36,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:56:36,314 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:56:36,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 00:56:36,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 00:56:36,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:56:36,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 00:56:36,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:56:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:56:36,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:56:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:56:36,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:56:36,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962228974] [2023-11-29 00:56:36,624 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:56:36,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737876396] [2023-11-29 00:56:36,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737876396] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:56:36,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:56:36,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2023-11-29 00:56:36,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259072306] [2023-11-29 00:56:36,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:56:36,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 00:56:36,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:56:36,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 00:56:36,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:56:36,626 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:56:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:56:36,928 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2023-11-29 00:56:36,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:56:36,928 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 [2023-11-29 00:56:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:56:36,929 INFO L225 Difference]: With dead ends: 111 [2023-11-29 00:56:36,929 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 00:56:36,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2023-11-29 00:56:36,930 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 85 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:56:36,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 106 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:56:36,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 00:56:36,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2023-11-29 00:56:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:56:36,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2023-11-29 00:56:36,964 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 29 [2023-11-29 00:56:36,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:56:36,964 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2023-11-29 00:56:36,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:56:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2023-11-29 00:56:36,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:56:36,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:56:36,965 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:56:36,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 00:56:37,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 00:56:37,166 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:56:37,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:56:37,166 INFO L85 PathProgramCache]: Analyzing trace with hash -804498519, now seen corresponding path program 10 times [2023-11-29 00:56:37,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:56:37,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10853770] [2023-11-29 00:56:37,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:56:37,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:56:37,181 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:56:37,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104976120] [2023-11-29 00:56:37,182 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:56:37,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:56:37,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:56:37,183 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:56:37,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 00:56:37,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:56:37,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:56:37,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 90 conjunts are in the unsatisfiable core [2023-11-29 00:56:37,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:56:37,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:56:37,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 00:56:37,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-11-29 00:56:37,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:37,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2023-11-29 00:56:37,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:37,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2023-11-29 00:56:37,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-29 00:56:37,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-11-29 00:56:37,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2023-11-29 00:56:37,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2023-11-29 00:56:38,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:38,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2023-11-29 00:56:38,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:38,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2023-11-29 00:56:38,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:38,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2023-11-29 00:56:38,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:38,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2023-11-29 00:56:38,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:38,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2023-11-29 00:56:38,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:38,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2023-11-29 00:56:38,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:38,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2023-11-29 00:56:38,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:56:38,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2023-11-29 00:56:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:56:38,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:56:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:56:42,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:56:42,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10853770] [2023-11-29 00:56:42,324 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:56:42,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104976120] [2023-11-29 00:56:42,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104976120] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:56:42,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:56:42,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 00:56:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865785958] [2023-11-29 00:56:42,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:56:42,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 00:56:42,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:56:42,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 00:56:42,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2126, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 00:56:42,327 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:57:06,592 WARN L293 SmtUtils]: Spent 7.68s on a formula simplification. DAG size of input: 106 DAG size of output: 101 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:58:31,041 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:58:45,881 WARN L293 SmtUtils]: Spent 5.76s on a formula simplification. DAG size of input: 147 DAG size of output: 111 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:59:20,754 WARN L293 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 159 DAG size of output: 91 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:00:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:00:58,305 INFO L93 Difference]: Finished difference Result 200 states and 230 transitions. [2023-11-29 01:00:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2023-11-29 01:00:58,305 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 01:00:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:00:58,307 INFO L225 Difference]: With dead ends: 200 [2023-11-29 01:00:58,307 INFO L226 Difference]: Without dead ends: 198 [2023-11-29 01:00:58,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6508 ImplicationChecksByTransitivity, 227.1s TimeCoverageRelationStatistics Valid=2907, Invalid=20044, Unknown=1, NotChecked=0, Total=22952 [2023-11-29 01:00:58,313 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 485 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:00:58,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 367 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 32.4s Time] [2023-11-29 01:00:58,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-11-29 01:00:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 80. [2023-11-29 01:00:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 79 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:00:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2023-11-29 01:00:58,379 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 31 [2023-11-29 01:00:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:00:58,379 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2023-11-29 01:00:58,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:00:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2023-11-29 01:00:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 01:00:58,380 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:00:58,380 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:00:58,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 01:00:58,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 01:00:58,581 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:00:58,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:00:58,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1666957567, now seen corresponding path program 11 times [2023-11-29 01:00:58,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:00:58,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551228630] [2023-11-29 01:00:58,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:00:58,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:00:58,598 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:00:58,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332900334] [2023-11-29 01:00:58,598 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:00:58,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:00:58,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:00:58,600 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:00:58,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 01:00:59,031 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-29 01:00:59,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:00:59,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:00:59,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:00:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 01:00:59,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:00:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 01:00:59,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:00:59,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551228630] [2023-11-29 01:00:59,185 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:00:59,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332900334] [2023-11-29 01:00:59,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332900334] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:00:59,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:00:59,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2023-11-29 01:00:59,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739899818] [2023-11-29 01:00:59,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:00:59,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 01:00:59,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:00:59,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 01:00:59,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-11-29 01:00:59,186 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 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) [2023-11-29 01:00:59,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:00:59,583 INFO L93 Difference]: Finished difference Result 177 states and 197 transitions. [2023-11-29 01:00:59,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 01:00:59,583 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 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 32 [2023-11-29 01:00:59,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:00:59,584 INFO L225 Difference]: With dead ends: 177 [2023-11-29 01:00:59,584 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 01:00:59,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2023-11-29 01:00:59,585 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 157 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:00:59,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 101 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:00:59,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 01:00:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 100. [2023-11-29 01:00:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.1313131313131313) internal successors, (112), 99 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:00:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2023-11-29 01:00:59,658 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 32 [2023-11-29 01:00:59,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:00:59,658 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2023-11-29 01:00:59,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 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) [2023-11-29 01:00:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2023-11-29 01:00:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 01:00:59,659 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:00:59,659 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:00:59,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 01:00:59,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 01:00:59,859 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:00:59,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:00:59,860 INFO L85 PathProgramCache]: Analyzing trace with hash -736536282, now seen corresponding path program 2 times [2023-11-29 01:00:59,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:00:59,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721501328] [2023-11-29 01:00:59,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:00:59,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:00:59,876 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 01:00:59,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1931171397] [2023-11-29 01:00:59,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:00:59,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:00:59,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:00:59,877 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:00:59,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643521eb-11dd-4021-923c-43d6f2190f44/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 01:00:59,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:00:59,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:00:59,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-29 01:00:59,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:00:59,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:01:00,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:01:00,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 01:01:00,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:01:00,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 01:01:00,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:01:00,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:01:00,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:01:00,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:01:00,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 01:01:00,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:01:00,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 01:01:00,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:01:00,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 01:01:00,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:01:00,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 01:01:00,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:01:00,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 01:01:00,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:01:00,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 01:01:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:01:00,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:01:10,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 366 [2023-11-29 01:01:14,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:01:14,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33130 treesize of output 30570 [2023-11-29 01:01:27,413 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 0)) (.cse12 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0)) (.cse0 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse15 (forall ((v_arrayElimCell_141 Int)) (let ((.cse36 (+ .cse0 3 v_arrayElimCell_141))) (or (= (mod (+ .cse0 (* 2 v_arrayElimCell_141) 2) .cse36) 0) (not (= (mod .cse36 .cse36) 0)))))) (.cse13 (not .cse12)) (.cse7 (not .cse11)) (.cse2 (= 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse23 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int)) (let ((.cse1 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_142 1) .cse1) 0)) (= (mod .cse1 .cse1) 0)))) (not .cse2)) (or .cse3 .cse2 (and (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse4 (* 2 v_arrayElimCell_141)) (.cse5 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (= (mod (+ .cse0 .cse4 2) (+ .cse0 3 v_arrayElimCell_141)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse5) 0)) (= (mod (+ .cse0 .cse4 v_arrayElimCell_140 1) .cse5) 0) (= (let ((.cse6 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse6 .cse6)) 0)))) .cse7) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse9 (* 2 v_arrayElimCell_141)) (.cse8 (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_142 v_arrayElimCell_141) .cse8) 0)) (= (mod (+ .cse0 .cse9 2) (+ .cse0 3 v_arrayElimCell_141)) 0) (= (mod (+ .cse0 .cse9 v_arrayElimCell_142 v_arrayElimCell_140) .cse8) 0) (= (let ((.cse10 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse10 .cse10)) 0)))) .cse11 .cse12) (or .cse13 (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int)) (= (let ((.cse14 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse14 .cse14)) 0)) .cse15) (or (and (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse16 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse16) 0)) (= (mod (+ .cse0 (* 2 v_arrayElimCell_141) v_arrayElimCell_140 1) .cse16) 0) (= (let ((.cse17 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse17 .cse17)) 0)))) .cse7) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse18 (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_142 v_arrayElimCell_141) .cse18) 0)) (= (mod (+ .cse0 (* 2 v_arrayElimCell_141) v_arrayElimCell_142 v_arrayElimCell_140) .cse18) 0) (= (let ((.cse19 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse19 .cse19)) 0)))) .cse11) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse20 (* 2 v_arrayElimCell_141)) (.cse21 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (= (mod (+ .cse0 .cse20 v_arrayElimCell_142 v_arrayElimCell_140) (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse21) 0)) (= (mod (+ .cse0 .cse20 v_arrayElimCell_140 1) .cse21) 0) (= (let ((.cse22 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse22 .cse22)) 0)))) .cse7)) .cse12)) .cse23) (or .cse3 (and (or (and (or .cse11 (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse25 (* 2 v_arrayElimCell_141)) (.cse24 (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_142 v_arrayElimCell_141) .cse24) 0)) (= (mod (+ .cse0 .cse25 2) (+ .cse0 3 v_arrayElimCell_141)) 0) (= (mod (+ .cse0 .cse25 v_arrayElimCell_142 v_arrayElimCell_140) .cse24) 0))))) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse26 (* 2 v_arrayElimCell_141)) (.cse27 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (= (mod (+ .cse0 .cse26 2) (+ .cse0 3 v_arrayElimCell_141)) 0) (= (mod (+ .cse0 .cse26 v_arrayElimCell_142 v_arrayElimCell_140) (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse27) 0)) (= (mod (+ .cse0 .cse26 v_arrayElimCell_140 1) .cse27) 0)))) .cse7)) .cse12) (or .cse13 .cse15) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse28 (* 2 v_arrayElimCell_141)) (.cse29 (+ .cse0 3 v_arrayElimCell_141))) (or (= (mod (+ .cse0 .cse28 2) .cse29) 0) (= (mod (+ .cse0 .cse28 v_arrayElimCell_142 v_arrayElimCell_140) (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1)) 0) (not (= (mod .cse29 .cse29) 0))))) .cse13) (or (and (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse30 (* 2 v_arrayElimCell_141)) (.cse31 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (= (mod (+ .cse0 .cse30 v_arrayElimCell_142 v_arrayElimCell_140) (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse31) 0)) (= (mod (+ .cse0 .cse30 v_arrayElimCell_140 1) .cse31) 0)))) .cse7) (or .cse11 (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse32 (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_142 v_arrayElimCell_141) .cse32) 0)) (= (mod (+ .cse0 (* 2 v_arrayElimCell_141) v_arrayElimCell_142 v_arrayElimCell_140) .cse32) 0))))) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_141 Int)) (let ((.cse33 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse33) 0)) (= (mod (+ .cse0 (* 2 v_arrayElimCell_141) v_arrayElimCell_140 1) .cse33) 0)))) .cse7)) .cse12) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_141 Int)) (let ((.cse34 (* 2 v_arrayElimCell_141)) (.cse35 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (= (mod (+ .cse0 .cse34 2) (+ .cse0 3 v_arrayElimCell_141)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse35) 0)) (= (mod (+ .cse0 .cse34 v_arrayElimCell_140 1) .cse35) 0)))) .cse7)) .cse2 .cse23)))) is different from false [2023-11-29 01:01:31,421 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse11 (= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 0)) (.cse12 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0)) (.cse0 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse15 (forall ((v_arrayElimCell_141 Int)) (let ((.cse36 (+ .cse0 3 v_arrayElimCell_141))) (or (= (mod (+ .cse0 (* 2 v_arrayElimCell_141) 2) .cse36) 0) (not (= (mod .cse36 .cse36) 0)))))) (.cse13 (not .cse12)) (.cse7 (not .cse11)) (.cse2 (= 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse23 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int)) (let ((.cse1 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_142 1) .cse1) 0)) (= (mod .cse1 .cse1) 0)))) (not .cse2)) (or .cse3 .cse2 (and (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse4 (* 2 v_arrayElimCell_141)) (.cse5 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (= (mod (+ .cse0 .cse4 2) (+ .cse0 3 v_arrayElimCell_141)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse5) 0)) (= (mod (+ .cse0 .cse4 v_arrayElimCell_140 1) .cse5) 0) (= (let ((.cse6 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse6 .cse6)) 0)))) .cse7) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse9 (* 2 v_arrayElimCell_141)) (.cse8 (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_142 v_arrayElimCell_141) .cse8) 0)) (= (mod (+ .cse0 .cse9 2) (+ .cse0 3 v_arrayElimCell_141)) 0) (= (mod (+ .cse0 .cse9 v_arrayElimCell_142 v_arrayElimCell_140) .cse8) 0) (= (let ((.cse10 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse10 .cse10)) 0)))) .cse11 .cse12) (or .cse13 (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int)) (= (let ((.cse14 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse14 .cse14)) 0)) .cse15) (or (and (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse16 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse16) 0)) (= (mod (+ .cse0 (* 2 v_arrayElimCell_141) v_arrayElimCell_140 1) .cse16) 0) (= (let ((.cse17 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse17 .cse17)) 0)))) .cse7) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse18 (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_142 v_arrayElimCell_141) .cse18) 0)) (= (mod (+ .cse0 (* 2 v_arrayElimCell_141) v_arrayElimCell_142 v_arrayElimCell_140) .cse18) 0) (= (let ((.cse19 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse19 .cse19)) 0)))) .cse11) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse20 (* 2 v_arrayElimCell_141)) (.cse21 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (= (mod (+ .cse0 .cse20 v_arrayElimCell_142 v_arrayElimCell_140) (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse21) 0)) (= (mod (+ .cse0 .cse20 v_arrayElimCell_140 1) .cse21) 0) (= (let ((.cse22 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse22 .cse22)) 0)))) .cse7)) .cse12)) .cse23) (or .cse3 (and (or (and (or .cse11 (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse25 (* 2 v_arrayElimCell_141)) (.cse24 (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_142 v_arrayElimCell_141) .cse24) 0)) (= (mod (+ .cse0 .cse25 2) (+ .cse0 3 v_arrayElimCell_141)) 0) (= (mod (+ .cse0 .cse25 v_arrayElimCell_142 v_arrayElimCell_140) .cse24) 0))))) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse26 (* 2 v_arrayElimCell_141)) (.cse27 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (= (mod (+ .cse0 .cse26 2) (+ .cse0 3 v_arrayElimCell_141)) 0) (= (mod (+ .cse0 .cse26 v_arrayElimCell_142 v_arrayElimCell_140) (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse27) 0)) (= (mod (+ .cse0 .cse26 v_arrayElimCell_140 1) .cse27) 0)))) .cse7)) .cse12) (or .cse13 .cse15) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse28 (* 2 v_arrayElimCell_141)) (.cse29 (+ .cse0 3 v_arrayElimCell_141))) (or (= (mod (+ .cse0 .cse28 2) .cse29) 0) (= (mod (+ .cse0 .cse28 v_arrayElimCell_142 v_arrayElimCell_140) (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1)) 0) (not (= (mod .cse29 .cse29) 0))))) .cse13) (or (and (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse30 (* 2 v_arrayElimCell_141)) (.cse31 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (= (mod (+ .cse0 .cse30 v_arrayElimCell_142 v_arrayElimCell_140) (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse31) 0)) (= (mod (+ .cse0 .cse30 v_arrayElimCell_140 1) .cse31) 0)))) .cse7) (or .cse11 (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse32 (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_142 v_arrayElimCell_141) .cse32) 0)) (= (mod (+ .cse0 (* 2 v_arrayElimCell_141) v_arrayElimCell_142 v_arrayElimCell_140) .cse32) 0))))) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_141 Int)) (let ((.cse33 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse33) 0)) (= (mod (+ .cse0 (* 2 v_arrayElimCell_141) v_arrayElimCell_140 1) .cse33) 0)))) .cse7)) .cse12) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_141 Int)) (let ((.cse34 (* 2 v_arrayElimCell_141)) (.cse35 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (= (mod (+ .cse0 .cse34 2) (+ .cse0 3 v_arrayElimCell_141)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse35) 0)) (= (mod (+ .cse0 .cse34 v_arrayElimCell_140 1) .cse35) 0)))) .cse7)) .cse2 .cse23)))) is different from true [2023-11-29 01:01:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-29 01:01:31,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:01:31,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721501328] [2023-11-29 01:01:31,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:01:31,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931171397] [2023-11-29 01:01:31,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931171397] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:01:31,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:01:31,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2023-11-29 01:01:31,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584520914] [2023-11-29 01:01:31,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:01:31,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-29 01:01:31,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:01:31,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-29 01:01:31,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1622, Unknown=3, NotChecked=86, Total=2070 [2023-11-29 01:01:31,428 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand has 46 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:01:35,528 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse11 (= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 0)) (.cse12 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0)) (.cse0 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse15 (forall ((v_arrayElimCell_141 Int)) (let ((.cse36 (+ .cse0 3 v_arrayElimCell_141))) (or (= (mod (+ .cse0 (* 2 v_arrayElimCell_141) 2) .cse36) 0) (not (= (mod .cse36 .cse36) 0)))))) (.cse13 (not .cse12)) (.cse7 (not .cse11)) (.cse2 (= 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse23 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int)) (let ((.cse1 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_142 1) .cse1) 0)) (= (mod .cse1 .cse1) 0)))) (not .cse2)) (or .cse3 .cse2 (and (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse4 (* 2 v_arrayElimCell_141)) (.cse5 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (= (mod (+ .cse0 .cse4 2) (+ .cse0 3 v_arrayElimCell_141)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse5) 0)) (= (mod (+ .cse0 .cse4 v_arrayElimCell_140 1) .cse5) 0) (= (let ((.cse6 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse6 .cse6)) 0)))) .cse7) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse9 (* 2 v_arrayElimCell_141)) (.cse8 (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_142 v_arrayElimCell_141) .cse8) 0)) (= (mod (+ .cse0 .cse9 2) (+ .cse0 3 v_arrayElimCell_141)) 0) (= (mod (+ .cse0 .cse9 v_arrayElimCell_142 v_arrayElimCell_140) .cse8) 0) (= (let ((.cse10 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse10 .cse10)) 0)))) .cse11 .cse12) (or .cse13 (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int)) (= (let ((.cse14 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse14 .cse14)) 0)) .cse15) (or (and (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse16 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse16) 0)) (= (mod (+ .cse0 (* 2 v_arrayElimCell_141) v_arrayElimCell_140 1) .cse16) 0) (= (let ((.cse17 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse17 .cse17)) 0)))) .cse7) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse18 (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_142 v_arrayElimCell_141) .cse18) 0)) (= (mod (+ .cse0 (* 2 v_arrayElimCell_141) v_arrayElimCell_142 v_arrayElimCell_140) .cse18) 0) (= (let ((.cse19 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse19 .cse19)) 0)))) .cse11) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse20 (* 2 v_arrayElimCell_141)) (.cse21 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (= (mod (+ .cse0 .cse20 v_arrayElimCell_142 v_arrayElimCell_140) (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse21) 0)) (= (mod (+ .cse0 .cse20 v_arrayElimCell_140 1) .cse21) 0) (= (let ((.cse22 (+ .cse0 2 v_arrayElimCell_142 v_arrayElimCell_140))) (mod .cse22 .cse22)) 0)))) .cse7)) .cse12)) .cse23) .cse3 (= .cse0 0) (or .cse3 (and (or (and (or .cse11 (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse25 (* 2 v_arrayElimCell_141)) (.cse24 (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_142 v_arrayElimCell_141) .cse24) 0)) (= (mod (+ .cse0 .cse25 2) (+ .cse0 3 v_arrayElimCell_141)) 0) (= (mod (+ .cse0 .cse25 v_arrayElimCell_142 v_arrayElimCell_140) .cse24) 0))))) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse26 (* 2 v_arrayElimCell_141)) (.cse27 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (= (mod (+ .cse0 .cse26 2) (+ .cse0 3 v_arrayElimCell_141)) 0) (= (mod (+ .cse0 .cse26 v_arrayElimCell_142 v_arrayElimCell_140) (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse27) 0)) (= (mod (+ .cse0 .cse26 v_arrayElimCell_140 1) .cse27) 0)))) .cse7)) .cse12) (or .cse13 .cse15) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse28 (* 2 v_arrayElimCell_141)) (.cse29 (+ .cse0 3 v_arrayElimCell_141))) (or (= (mod (+ .cse0 .cse28 2) .cse29) 0) (= (mod (+ .cse0 .cse28 v_arrayElimCell_142 v_arrayElimCell_140) (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1)) 0) (not (= (mod .cse29 .cse29) 0))))) .cse13) (or (and (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse30 (* 2 v_arrayElimCell_141)) (.cse31 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (= (mod (+ .cse0 .cse30 v_arrayElimCell_142 v_arrayElimCell_140) (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse31) 0)) (= (mod (+ .cse0 .cse30 v_arrayElimCell_140 1) .cse31) 0)))) .cse7) (or .cse11 (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_142 Int) (v_arrayElimCell_141 Int)) (let ((.cse32 (+ .cse0 v_arrayElimCell_142 v_arrayElimCell_141 v_arrayElimCell_140 1))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_142 v_arrayElimCell_141) .cse32) 0)) (= (mod (+ .cse0 (* 2 v_arrayElimCell_141) v_arrayElimCell_142 v_arrayElimCell_140) .cse32) 0))))) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_141 Int)) (let ((.cse33 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse33) 0)) (= (mod (+ .cse0 (* 2 v_arrayElimCell_141) v_arrayElimCell_140 1) .cse33) 0)))) .cse7)) .cse12) (or (forall ((v_arrayElimCell_140 Int) (v_arrayElimCell_141 Int)) (let ((.cse34 (* 2 v_arrayElimCell_141)) (.cse35 (+ .cse0 2 v_arrayElimCell_141 v_arrayElimCell_140))) (or (= (mod (+ .cse0 .cse34 2) (+ .cse0 3 v_arrayElimCell_141)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_140) v_arrayElimCell_141 1) .cse35) 0)) (= (mod (+ .cse0 .cse34 v_arrayElimCell_140 1) .cse35) 0)))) .cse7)) .cse2 .cse23) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from true [2023-11-29 01:04:15,730 WARN L293 SmtUtils]: Spent 2.25m on a formula simplification that was a NOOP. DAG size: 151 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:04:19,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 01:04:23,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 01:04:25,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 01:04:29,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 01:04:31,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 01:04:33,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 01:04:37,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 01:04:41,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 01:04:45,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 01:05:10,047 WARN L293 SmtUtils]: Spent 21.06s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:05:14,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 01:05:15,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers []